/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/mix051_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 10:12:59,230 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 10:12:59,232 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 10:12:59,256 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 10:12:59,256 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 10:12:59,258 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 10:12:59,259 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 10:12:59,261 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 10:12:59,262 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 10:12:59,263 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 10:12:59,263 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 10:12:59,264 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 10:12:59,265 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 10:12:59,266 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 10:12:59,267 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 10:12:59,268 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 10:12:59,268 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 10:12:59,269 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 10:12:59,271 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 10:12:59,272 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 10:12:59,274 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 10:12:59,275 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 10:12:59,276 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 10:12:59,277 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 10:12:59,283 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 10:12:59,283 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 10:12:59,283 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 10:12:59,284 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 10:12:59,285 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 10:12:59,285 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 10:12:59,286 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 10:12:59,286 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 10:12:59,287 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 10:12:59,287 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 10:12:59,288 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 10:12:59,289 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 10:12:59,289 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 10:12:59,289 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 10:12:59,290 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 10:12:59,290 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 10:12:59,291 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 10:12:59,296 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-03-26 10:12:59,338 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 10:12:59,338 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 10:12:59,341 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 10:12:59,342 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 10:12:59,342 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 10:12:59,342 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 10:12:59,342 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 10:12:59,342 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 10:12:59,342 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 10:12:59,342 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 10:12:59,343 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 10:12:59,343 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 10:12:59,344 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 10:12:59,344 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 10:12:59,344 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 10:12:59,344 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 10:12:59,344 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 10:12:59,344 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 10:12:59,344 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 10:12:59,344 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 10:12:59,345 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 10:12:59,345 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:12:59,345 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 10:12:59,345 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 10:12:59,345 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 10:12:59,346 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 10:12:59,346 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 10:12:59,346 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 10:12:59,346 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 10:12:59,346 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 10:12:59,346 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 10:12:59,672 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 10:12:59,700 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 10:12:59,703 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 10:12:59,704 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 10:12:59,704 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 10:12:59,705 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix051_rmo.oepc.i [2021-03-26 10:12:59,765 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cdceddd4/42c5650309294baba60d81b96c19ae6d/FLAGac7868471 [2021-03-26 10:13:00,335 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 10:13:00,337 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix051_rmo.oepc.i [2021-03-26 10:13:00,355 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cdceddd4/42c5650309294baba60d81b96c19ae6d/FLAGac7868471 [2021-03-26 10:13:00,733 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cdceddd4/42c5650309294baba60d81b96c19ae6d [2021-03-26 10:13:00,735 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 10:13:00,736 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 10:13:00,737 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 10:13:00,737 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 10:13:00,745 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 10:13:00,746 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:13:00" (1/1) ... [2021-03-26 10:13:00,747 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eae48c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:13:00, skipping insertion in model container [2021-03-26 10:13:00,747 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:13:00" (1/1) ... [2021-03-26 10:13:00,755 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 10:13:00,804 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 10:13:00,942 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/mix051_rmo.oepc.i[949,962] [2021-03-26 10:13:01,145 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:13:01,151 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 10:13:01,161 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/mix051_rmo.oepc.i[949,962] [2021-03-26 10:13:01,197 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:13:01,262 INFO L208 MainTranslator]: Completed translation [2021-03-26 10:13:01,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:13:01 WrapperNode [2021-03-26 10:13:01,264 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 10:13:01,266 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 10:13:01,266 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 10:13:01,266 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 10:13:01,273 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:13:01" (1/1) ... [2021-03-26 10:13:01,309 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:13:01" (1/1) ... [2021-03-26 10:13:01,330 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 10:13:01,330 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 10:13:01,330 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 10:13:01,330 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 10:13:01,337 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:13:01" (1/1) ... [2021-03-26 10:13:01,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:13:01" (1/1) ... [2021-03-26 10:13:01,341 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:13:01" (1/1) ... [2021-03-26 10:13:01,341 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:13:01" (1/1) ... [2021-03-26 10:13:01,351 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:13:01" (1/1) ... [2021-03-26 10:13:01,355 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:13:01" (1/1) ... [2021-03-26 10:13:01,358 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:13:01" (1/1) ... [2021-03-26 10:13:01,362 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 10:13:01,363 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 10:13:01,363 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 10:13:01,363 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 10:13:01,364 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:13:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:13:01,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 10:13:01,425 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 10:13:01,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 10:13:01,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 10:13:01,425 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 10:13:01,425 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 10:13:01,425 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 10:13:01,425 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 10:13:01,425 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 10:13:01,426 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 10:13:01,426 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-26 10:13:01,426 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-26 10:13:01,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 10:13:01,426 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 10:13:01,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 10:13:01,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 10:13:01,428 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 10:13:03,403 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 10:13:03,404 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 10:13:03,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:13:03 BoogieIcfgContainer [2021-03-26 10:13:03,405 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 10:13:03,407 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 10:13:03,407 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 10:13:03,409 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 10:13:03,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 10:13:00" (1/3) ... [2021-03-26 10:13:03,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c00a9f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:13:03, skipping insertion in model container [2021-03-26 10:13:03,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:13:01" (2/3) ... [2021-03-26 10:13:03,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c00a9f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:13:03, skipping insertion in model container [2021-03-26 10:13:03,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:13:03" (3/3) ... [2021-03-26 10:13:03,411 INFO L111 eAbstractionObserver]: Analyzing ICFG mix051_rmo.oepc.i [2021-03-26 10:13:03,417 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 10:13:03,421 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 10:13:03,422 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 10:13:03,456 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,456 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,456 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,456 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,457 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,457 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,457 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,457 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,457 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,457 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,457 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,457 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,458 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,458 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,458 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,458 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,458 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,458 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,458 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,461 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,461 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,461 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,461 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,461 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,461 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,462 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,462 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,462 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,462 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,462 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,462 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,462 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,462 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,462 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,464 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,464 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,464 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,465 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,465 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,465 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,465 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,465 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,465 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,465 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,465 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,465 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,466 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,466 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,466 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,466 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,466 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,466 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,466 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,468 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,468 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,468 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,468 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,468 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,468 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,468 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,468 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,469 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,469 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,469 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,469 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,469 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,469 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,469 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,469 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,469 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,470 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,470 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,470 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,470 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,470 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,470 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,470 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,470 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,470 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,470 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,471 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,471 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,471 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,471 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,471 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,471 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,471 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,471 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,471 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,471 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,471 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,471 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,472 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,472 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,472 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,472 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,472 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,472 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,472 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,474 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,474 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,474 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,474 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,475 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,475 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,475 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,475 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,475 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,475 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,475 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,475 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,475 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,475 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,475 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,475 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,475 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,476 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,476 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,476 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,476 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,476 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,476 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,476 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,476 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,476 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,476 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,476 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,476 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,477 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,477 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,477 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,477 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,477 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,477 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,477 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,477 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,477 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,479 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,479 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,479 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,479 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,479 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,480 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,480 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,480 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,480 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,480 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,480 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,480 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,480 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,480 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,481 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,481 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,481 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,481 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,483 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,483 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,483 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,483 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,483 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,483 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,483 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,483 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,483 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,484 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,484 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,484 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,485 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,485 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,485 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,486 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,486 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,486 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,486 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,486 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,486 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,486 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,492 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,492 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,492 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,492 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,492 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,500 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,500 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,500 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,500 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,500 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,503 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,503 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,503 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,504 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,506 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,506 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,506 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,506 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,506 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,507 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,507 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,507 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,507 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,507 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,507 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,507 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,507 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,507 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,508 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,508 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,508 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,508 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,508 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,508 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,508 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,508 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,509 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,509 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:03,510 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 10:13:03,523 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-26 10:13:03,536 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 10:13:03,536 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 10:13:03,537 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 10:13:03,537 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 10:13:03,537 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 10:13:03,537 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 10:13:03,537 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 10:13:03,537 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 10:13:03,551 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 127 places, 116 transitions, 252 flow [2021-03-26 10:13:03,589 INFO L129 PetriNetUnfolder]: 2/112 cut-off events. [2021-03-26 10:13:03,589 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:13:03,593 INFO L84 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 90 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-03-26 10:13:03,593 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 116 transitions, 252 flow [2021-03-26 10:13:03,597 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 112 transitions, 236 flow [2021-03-26 10:13:03,598 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:13:03,609 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 112 transitions, 236 flow [2021-03-26 10:13:03,611 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 112 transitions, 236 flow [2021-03-26 10:13:03,613 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 123 places, 112 transitions, 236 flow [2021-03-26 10:13:03,631 INFO L129 PetriNetUnfolder]: 2/112 cut-off events. [2021-03-26 10:13:03,631 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:13:03,632 INFO L84 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 87 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-03-26 10:13:03,635 INFO L142 LiptonReduction]: Number of co-enabled transitions 2672 [2021-03-26 10:13:05,048 WARN L205 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 10:13:05,487 WARN L205 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 10:13:05,612 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 10:13:07,165 INFO L154 LiptonReduction]: Checked pairs total: 5017 [2021-03-26 10:13:07,165 INFO L156 LiptonReduction]: Total number of compositions: 74 [2021-03-26 10:13:07,167 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3570 [2021-03-26 10:13:07,174 INFO L129 PetriNetUnfolder]: 0/11 cut-off events. [2021-03-26 10:13:07,174 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:13:07,174 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:13:07,174 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:13:07,175 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:13:07,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:13:07,178 INFO L82 PathProgramCache]: Analyzing trace with hash 346426910, now seen corresponding path program 1 times [2021-03-26 10:13:07,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:13:07,184 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997417740] [2021-03-26 10:13:07,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:13:07,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:13:07,360 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:07,361 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:13:07,362 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:07,362 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:13:07,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:13:07,368 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997417740] [2021-03-26 10:13:07,369 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:13:07,369 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:13:07,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98399277] [2021-03-26 10:13:07,376 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:13:07,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:13:07,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:13:07,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:13:07,389 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 190 [2021-03-26 10:13:07,391 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:07,392 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:13:07,392 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 190 [2021-03-26 10:13:07,393 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:13:07,526 INFO L129 PetriNetUnfolder]: 133/297 cut-off events. [2021-03-26 10:13:07,526 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:13:07,530 INFO L84 FinitePrefix]: Finished finitePrefix Result has 516 conditions, 297 events. 133/297 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1484 event pairs, 110 based on Foata normal form. 32/312 useless extension candidates. Maximal degree in co-relation 496. Up to 153 conditions per place. [2021-03-26 10:13:07,533 INFO L132 encePairwiseOnDemand]: 186/190 looper letters, 11 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2021-03-26 10:13:07,534 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 48 transitions, 134 flow [2021-03-26 10:13:07,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:13:07,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:13:07,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 523 transitions. [2021-03-26 10:13:07,555 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9175438596491228 [2021-03-26 10:13:07,555 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 523 transitions. [2021-03-26 10:13:07,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 523 transitions. [2021-03-26 10:13:07,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:13:07,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 523 transitions. [2021-03-26 10:13:07,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:07,578 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 190.0) internal successors, (760), 4 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:07,579 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 190.0) internal successors, (760), 4 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:07,581 INFO L185 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 523 transitions. [2021-03-26 10:13:07,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 48 transitions, 134 flow [2021-03-26 10:13:07,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 48 transitions, 130 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-26 10:13:07,589 INFO L241 Difference]: Finished difference. Result has 54 places, 43 transitions, 98 flow [2021-03-26 10:13:07,591 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2021-03-26 10:13:07,591 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -4 predicate places. [2021-03-26 10:13:07,591 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:13:07,592 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 43 transitions, 98 flow [2021-03-26 10:13:07,593 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 43 transitions, 98 flow [2021-03-26 10:13:07,593 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 43 transitions, 98 flow [2021-03-26 10:13:07,599 INFO L129 PetriNetUnfolder]: 0/43 cut-off events. [2021-03-26 10:13:07,599 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:13:07,600 INFO L84 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 43 events. 0/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 54 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 10:13:07,602 INFO L142 LiptonReduction]: Number of co-enabled transitions 608 [2021-03-26 10:13:08,110 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-26 10:13:09,228 INFO L154 LiptonReduction]: Checked pairs total: 2496 [2021-03-26 10:13:09,228 INFO L156 LiptonReduction]: Total number of compositions: 12 [2021-03-26 10:13:09,228 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1637 [2021-03-26 10:13:09,229 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 74 flow [2021-03-26 10:13:09,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:09,230 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:13:09,230 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 10:13:09,230 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 10:13:09,231 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:13:09,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:13:09,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1849849399, now seen corresponding path program 1 times [2021-03-26 10:13:09,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:13:09,232 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438058361] [2021-03-26 10:13:09,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:13:09,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:13:09,366 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:09,367 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:13:09,371 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-26 10:13:09,372 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 10:13:09,379 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 10:13:09,380 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:13:09,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:13:09,383 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438058361] [2021-03-26 10:13:09,383 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:13:09,383 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:13:09,383 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733519078] [2021-03-26 10:13:09,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:13:09,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:13:09,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:13:09,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:13:09,388 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 202 [2021-03-26 10:13:09,388 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 163.0) internal successors, (652), 4 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:09,389 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:13:09,389 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 202 [2021-03-26 10:13:09,389 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:13:09,515 INFO L129 PetriNetUnfolder]: 172/478 cut-off events. [2021-03-26 10:13:09,516 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:13:09,517 INFO L84 FinitePrefix]: Finished finitePrefix Result has 778 conditions, 478 events. 172/478 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3055 event pairs, 36 based on Foata normal form. 0/431 useless extension candidates. Maximal degree in co-relation 766. Up to 132 conditions per place. [2021-03-26 10:13:09,518 INFO L132 encePairwiseOnDemand]: 194/202 looper letters, 7 selfloop transitions, 6 changer transitions 13/47 dead transitions. [2021-03-26 10:13:09,519 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 47 transitions, 156 flow [2021-03-26 10:13:09,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:13:09,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:13:09,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 836 transitions. [2021-03-26 10:13:09,523 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8277227722772277 [2021-03-26 10:13:09,523 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 836 transitions. [2021-03-26 10:13:09,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 836 transitions. [2021-03-26 10:13:09,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:13:09,524 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 836 transitions. [2021-03-26 10:13:09,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 167.2) internal successors, (836), 5 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:09,528 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:09,529 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:09,529 INFO L185 Difference]: Start difference. First operand has 42 places, 31 transitions, 74 flow. Second operand 5 states and 836 transitions. [2021-03-26 10:13:09,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 47 transitions, 156 flow [2021-03-26 10:13:09,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 47 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:13:09,531 INFO L241 Difference]: Finished difference. Result has 48 places, 34 transitions, 122 flow [2021-03-26 10:13:09,531 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=122, PETRI_PLACES=48, PETRI_TRANSITIONS=34} [2021-03-26 10:13:09,531 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -10 predicate places. [2021-03-26 10:13:09,532 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:13:09,532 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 34 transitions, 122 flow [2021-03-26 10:13:09,532 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 34 transitions, 122 flow [2021-03-26 10:13:09,533 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 34 transitions, 122 flow [2021-03-26 10:13:09,577 INFO L129 PetriNetUnfolder]: 86/270 cut-off events. [2021-03-26 10:13:09,577 INFO L130 PetriNetUnfolder]: For 70/92 co-relation queries the response was YES. [2021-03-26 10:13:09,578 INFO L84 FinitePrefix]: Finished finitePrefix Result has 569 conditions, 270 events. 86/270 cut-off events. For 70/92 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1552 event pairs, 24 based on Foata normal form. 0/252 useless extension candidates. Maximal degree in co-relation 556. Up to 131 conditions per place. [2021-03-26 10:13:09,581 INFO L142 LiptonReduction]: Number of co-enabled transitions 470 [2021-03-26 10:13:10,081 WARN L205 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-03-26 10:13:10,219 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-03-26 10:13:10,563 WARN L205 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-03-26 10:13:10,709 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-03-26 10:13:10,742 INFO L154 LiptonReduction]: Checked pairs total: 1152 [2021-03-26 10:13:10,742 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:13:10,742 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1210 [2021-03-26 10:13:10,743 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 118 flow [2021-03-26 10:13:10,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 163.0) internal successors, (652), 4 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:10,744 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:13:10,744 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:13:10,744 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 10:13:10,744 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:13:10,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:13:10,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1156051992, now seen corresponding path program 1 times [2021-03-26 10:13:10,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:13:10,745 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655353272] [2021-03-26 10:13:10,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:13:10,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:13:10,813 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:10,814 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:13:10,816 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:10,823 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:13:10,828 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:10,829 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:13:10,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:13:10,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655353272] [2021-03-26 10:13:10,829 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:13:10,829 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:13:10,830 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44297502] [2021-03-26 10:13:10,830 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:13:10,830 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:13:10,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:13:10,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:13:10,832 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 204 [2021-03-26 10:13:10,832 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 118 flow. Second operand has 4 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 10:13:10,832 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:13:10,833 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 204 [2021-03-26 10:13:10,833 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:13:11,009 INFO L129 PetriNetUnfolder]: 584/1173 cut-off events. [2021-03-26 10:13:11,010 INFO L130 PetriNetUnfolder]: For 99/131 co-relation queries the response was YES. [2021-03-26 10:13:11,015 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2452 conditions, 1173 events. 584/1173 cut-off events. For 99/131 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 8556 event pairs, 276 based on Foata normal form. 88/1145 useless extension candidates. Maximal degree in co-relation 2439. Up to 690 conditions per place. [2021-03-26 10:13:11,021 INFO L132 encePairwiseOnDemand]: 197/204 looper letters, 10 selfloop transitions, 10 changer transitions 0/45 dead transitions. [2021-03-26 10:13:11,021 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 184 flow [2021-03-26 10:13:11,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:13:11,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:13:11,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 877 transitions. [2021-03-26 10:13:11,024 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8598039215686275 [2021-03-26 10:13:11,024 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 877 transitions. [2021-03-26 10:13:11,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 877 transitions. [2021-03-26 10:13:11,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:13:11,025 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 877 transitions. [2021-03-26 10:13:11,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 175.4) internal successors, (877), 5 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:11,029 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:11,030 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:11,030 INFO L185 Difference]: Start difference. First operand has 42 places, 32 transitions, 118 flow. Second operand 5 states and 877 transitions. [2021-03-26 10:13:11,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 184 flow [2021-03-26 10:13:11,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 45 transitions, 162 flow, removed 5 selfloop flow, removed 4 redundant places. [2021-03-26 10:13:11,036 INFO L241 Difference]: Finished difference. Result has 45 places, 41 transitions, 171 flow [2021-03-26 10:13:11,036 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=171, PETRI_PLACES=45, PETRI_TRANSITIONS=41} [2021-03-26 10:13:11,036 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -13 predicate places. [2021-03-26 10:13:11,036 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:13:11,037 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 41 transitions, 171 flow [2021-03-26 10:13:11,037 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 41 transitions, 171 flow [2021-03-26 10:13:11,038 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 41 transitions, 171 flow [2021-03-26 10:13:11,140 INFO L129 PetriNetUnfolder]: 591/1191 cut-off events. [2021-03-26 10:13:11,140 INFO L130 PetriNetUnfolder]: For 587/808 co-relation queries the response was YES. [2021-03-26 10:13:11,146 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3057 conditions, 1191 events. 591/1191 cut-off events. For 587/808 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 8953 event pairs, 283 based on Foata normal form. 6/1073 useless extension candidates. Maximal degree in co-relation 3045. Up to 718 conditions per place. [2021-03-26 10:13:11,157 INFO L142 LiptonReduction]: Number of co-enabled transitions 684 [2021-03-26 10:13:11,490 INFO L154 LiptonReduction]: Checked pairs total: 866 [2021-03-26 10:13:11,490 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:13:11,490 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 454 [2021-03-26 10:13:11,491 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 165 flow [2021-03-26 10:13:11,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 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 10:13:11,492 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:13:11,492 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:13:11,492 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 10:13:11,492 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:13:11,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:13:11,493 INFO L82 PathProgramCache]: Analyzing trace with hash -638440661, now seen corresponding path program 1 times [2021-03-26 10:13:11,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:13:11,493 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282020235] [2021-03-26 10:13:11,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:13:11,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:13:11,608 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:11,609 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:13:11,611 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:11,612 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:13:11,618 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:11,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:13:11,624 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:11,624 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:13:11,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:13:11,626 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282020235] [2021-03-26 10:13:11,626 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:13:11,626 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:13:11,626 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414314454] [2021-03-26 10:13:11,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:13:11,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:13:11,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:13:11,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:13:11,628 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 204 [2021-03-26 10:13:11,630 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 165 flow. Second operand has 5 states, 5 states have (on average 171.8) internal successors, (859), 5 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:11,630 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:13:11,630 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 204 [2021-03-26 10:13:11,630 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:13:11,759 INFO L129 PetriNetUnfolder]: 335/769 cut-off events. [2021-03-26 10:13:11,759 INFO L130 PetriNetUnfolder]: For 608/857 co-relation queries the response was YES. [2021-03-26 10:13:11,763 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2527 conditions, 769 events. 335/769 cut-off events. For 608/857 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 5294 event pairs, 79 based on Foata normal form. 150/875 useless extension candidates. Maximal degree in co-relation 2513. Up to 505 conditions per place. [2021-03-26 10:13:11,767 INFO L132 encePairwiseOnDemand]: 197/204 looper letters, 10 selfloop transitions, 14 changer transitions 0/49 dead transitions. [2021-03-26 10:13:11,767 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 49 transitions, 265 flow [2021-03-26 10:13:11,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:13:11,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:13:11,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1052 transitions. [2021-03-26 10:13:11,770 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8594771241830066 [2021-03-26 10:13:11,771 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1052 transitions. [2021-03-26 10:13:11,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1052 transitions. [2021-03-26 10:13:11,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:13:11,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1052 transitions. [2021-03-26 10:13:11,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 175.33333333333334) internal successors, (1052), 6 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:11,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 204.0) internal successors, (1428), 7 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:11,777 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 204.0) internal successors, (1428), 7 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:11,777 INFO L185 Difference]: Start difference. First operand has 45 places, 40 transitions, 165 flow. Second operand 6 states and 1052 transitions. [2021-03-26 10:13:11,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 49 transitions, 265 flow [2021-03-26 10:13:11,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 49 transitions, 258 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 10:13:11,784 INFO L241 Difference]: Finished difference. Result has 49 places, 45 transitions, 254 flow [2021-03-26 10:13:11,784 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=254, PETRI_PLACES=49, PETRI_TRANSITIONS=45} [2021-03-26 10:13:11,784 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -9 predicate places. [2021-03-26 10:13:11,784 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:13:11,785 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 45 transitions, 254 flow [2021-03-26 10:13:11,785 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 45 transitions, 254 flow [2021-03-26 10:13:11,785 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 45 transitions, 254 flow [2021-03-26 10:13:11,865 INFO L129 PetriNetUnfolder]: 337/769 cut-off events. [2021-03-26 10:13:11,865 INFO L130 PetriNetUnfolder]: For 1576/1957 co-relation queries the response was YES. [2021-03-26 10:13:11,870 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2920 conditions, 769 events. 337/769 cut-off events. For 1576/1957 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 5376 event pairs, 81 based on Foata normal form. 21/745 useless extension candidates. Maximal degree in co-relation 2905. Up to 507 conditions per place. [2021-03-26 10:13:11,877 INFO L142 LiptonReduction]: Number of co-enabled transitions 790 [2021-03-26 10:13:11,957 INFO L154 LiptonReduction]: Checked pairs total: 894 [2021-03-26 10:13:11,957 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:13:11,958 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 174 [2021-03-26 10:13:11,962 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 246 flow [2021-03-26 10:13:11,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 171.8) internal successors, (859), 5 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:11,963 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:13:11,963 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 10:13:11,963 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 10:13:11,963 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:13:11,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:13:11,964 INFO L82 PathProgramCache]: Analyzing trace with hash -515374375, now seen corresponding path program 1 times [2021-03-26 10:13:11,964 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:13:11,964 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085889767] [2021-03-26 10:13:11,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:13:12,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:13:12,094 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:12,094 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:13:12,096 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:12,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:13:12,100 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:12,100 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:13:12,104 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:12,105 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:13:12,111 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:12,112 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:13:12,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:13:12,112 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085889767] [2021-03-26 10:13:12,113 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:13:12,113 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:13:12,113 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853643572] [2021-03-26 10:13:12,113 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:13:12,113 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:13:12,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:13:12,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:13:12,115 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 204 [2021-03-26 10:13:12,116 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 246 flow. Second operand has 6 states, 6 states have (on average 171.83333333333334) internal successors, (1031), 6 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:12,117 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:13:12,117 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 204 [2021-03-26 10:13:12,117 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:13:12,258 INFO L129 PetriNetUnfolder]: 166/433 cut-off events. [2021-03-26 10:13:12,258 INFO L130 PetriNetUnfolder]: For 1016/1306 co-relation queries the response was YES. [2021-03-26 10:13:12,261 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1867 conditions, 433 events. 166/433 cut-off events. For 1016/1306 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2599 event pairs, 18 based on Foata normal form. 155/561 useless extension candidates. Maximal degree in co-relation 1850. Up to 288 conditions per place. [2021-03-26 10:13:12,263 INFO L132 encePairwiseOnDemand]: 197/204 looper letters, 6 selfloop transitions, 18 changer transitions 4/53 dead transitions. [2021-03-26 10:13:12,263 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 53 transitions, 388 flow [2021-03-26 10:13:12,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:13:12,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:13:12,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1227 transitions. [2021-03-26 10:13:12,266 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8592436974789915 [2021-03-26 10:13:12,266 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1227 transitions. [2021-03-26 10:13:12,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1227 transitions. [2021-03-26 10:13:12,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:13:12,267 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1227 transitions. [2021-03-26 10:13:12,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 175.28571428571428) internal successors, (1227), 7 states have internal predecessors, (1227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:12,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 204.0) internal successors, (1632), 8 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:12,273 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 204.0) internal successors, (1632), 8 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:12,273 INFO L185 Difference]: Start difference. First operand has 49 places, 44 transitions, 246 flow. Second operand 7 states and 1227 transitions. [2021-03-26 10:13:12,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 53 transitions, 388 flow [2021-03-26 10:13:12,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 53 transitions, 326 flow, removed 26 selfloop flow, removed 4 redundant places. [2021-03-26 10:13:12,279 INFO L241 Difference]: Finished difference. Result has 52 places, 49 transitions, 306 flow [2021-03-26 10:13:12,280 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=306, PETRI_PLACES=52, PETRI_TRANSITIONS=49} [2021-03-26 10:13:12,280 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -6 predicate places. [2021-03-26 10:13:12,280 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:13:12,280 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 49 transitions, 306 flow [2021-03-26 10:13:12,280 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 49 transitions, 306 flow [2021-03-26 10:13:12,281 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 49 transitions, 306 flow [2021-03-26 10:13:12,323 INFO L129 PetriNetUnfolder]: 160/425 cut-off events. [2021-03-26 10:13:12,323 INFO L130 PetriNetUnfolder]: For 765/796 co-relation queries the response was YES. [2021-03-26 10:13:12,325 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1585 conditions, 425 events. 160/425 cut-off events. For 765/796 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2555 event pairs, 18 based on Foata normal form. 1/399 useless extension candidates. Maximal degree in co-relation 1569. Up to 248 conditions per place. [2021-03-26 10:13:12,329 INFO L142 LiptonReduction]: Number of co-enabled transitions 790 [2021-03-26 10:13:12,356 INFO L154 LiptonReduction]: Checked pairs total: 1083 [2021-03-26 10:13:12,356 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:13:12,356 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 76 [2021-03-26 10:13:12,358 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 296 flow [2021-03-26 10:13:12,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 171.83333333333334) internal successors, (1031), 6 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:12,358 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:13:12,359 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:13:12,359 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 10:13:12,359 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:13:12,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:13:12,359 INFO L82 PathProgramCache]: Analyzing trace with hash -49096556, now seen corresponding path program 1 times [2021-03-26 10:13:12,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:13:12,360 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287672752] [2021-03-26 10:13:12,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:13:12,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:13:12,501 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:12,502 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:13:12,512 INFO L142 QuantifierPusher]: treesize reduction 9, result has 77.5 percent of original size [2021-03-26 10:13:12,514 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-26 10:13:12,545 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:12,547 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 10:13:12,567 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:12,567 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 10:13:12,583 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:12,585 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-26 10:13:12,616 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:12,617 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-26 10:13:12,647 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:12,647 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 10:13:12,669 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:12,669 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 10:13:12,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:13:12,683 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287672752] [2021-03-26 10:13:12,683 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:13:12,683 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-26 10:13:12,684 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758038560] [2021-03-26 10:13:12,684 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-26 10:13:12,684 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:13:12,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-26 10:13:12,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-03-26 10:13:12,686 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 204 [2021-03-26 10:13:12,687 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 48 transitions, 296 flow. Second operand has 10 states, 10 states have (on average 132.2) internal successors, (1322), 10 states have internal predecessors, (1322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:12,687 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:13:12,687 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 204 [2021-03-26 10:13:12,688 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:13:13,549 INFO L129 PetriNetUnfolder]: 1337/2530 cut-off events. [2021-03-26 10:13:13,550 INFO L130 PetriNetUnfolder]: For 3556/4481 co-relation queries the response was YES. [2021-03-26 10:13:13,560 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8031 conditions, 2530 events. 1337/2530 cut-off events. For 3556/4481 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 17072 event pairs, 71 based on Foata normal form. 19/2448 useless extension candidates. Maximal degree in co-relation 8013. Up to 777 conditions per place. [2021-03-26 10:13:13,574 INFO L132 encePairwiseOnDemand]: 191/204 looper letters, 51 selfloop transitions, 48 changer transitions 1/125 dead transitions. [2021-03-26 10:13:13,574 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 125 transitions, 734 flow [2021-03-26 10:13:13,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-26 10:13:13,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-26 10:13:13,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1538 transitions. [2021-03-26 10:13:13,578 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6853832442067737 [2021-03-26 10:13:13,578 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1538 transitions. [2021-03-26 10:13:13,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1538 transitions. [2021-03-26 10:13:13,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:13:13,580 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1538 transitions. [2021-03-26 10:13:13,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 139.8181818181818) internal successors, (1538), 11 states have internal predecessors, (1538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:13,587 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 204.0) internal successors, (2448), 12 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:13,587 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 204.0) internal successors, (2448), 12 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:13,587 INFO L185 Difference]: Start difference. First operand has 52 places, 48 transitions, 296 flow. Second operand 11 states and 1538 transitions. [2021-03-26 10:13:13,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 125 transitions, 734 flow [2021-03-26 10:13:13,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 125 transitions, 661 flow, removed 30 selfloop flow, removed 4 redundant places. [2021-03-26 10:13:13,642 INFO L241 Difference]: Finished difference. Result has 63 places, 91 transitions, 564 flow [2021-03-26 10:13:13,642 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=564, PETRI_PLACES=63, PETRI_TRANSITIONS=91} [2021-03-26 10:13:13,642 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 5 predicate places. [2021-03-26 10:13:13,642 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:13:13,642 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 91 transitions, 564 flow [2021-03-26 10:13:13,643 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 91 transitions, 564 flow [2021-03-26 10:13:13,643 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 63 places, 91 transitions, 564 flow [2021-03-26 10:13:13,777 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1157] L844-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_119 (+ v_~__unbuffered_cnt~0_120 1)) (= |v_P3Thread1of1ForFork3_#res.base_11| 0) (= |v_P3Thread1of1ForFork3_#res.offset_11| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_120} OutVars{P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_119, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_11|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset][14], [P1Thread1of1ForFork1InUse, 65#P0EXITtrue, P3Thread1of1ForFork3InUse, 37#L868-1true, Black: 159#(<= ~__unbuffered_cnt~0 1), 167#true, Black: 192#(and (= ~a$w_buff1~0 0) (<= 1 ~a$w_buff0_used~0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), 9#P1EXITtrue, Black: 194#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd3~0 0)), Black: 196#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~y~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd3~0 0)), Black: 182#(and (= ~a$w_buff1~0 0) (<= 1 ~a$w_buff0_used~0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 198#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~y~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 183#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 188#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))), 110#P3EXITtrue, Black: 137#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 171#(<= ~__unbuffered_cnt~0 2), 179#true, 53#P2EXITtrue, Black: 148#(<= ~__unbuffered_cnt~0 0), Black: 151#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse]) [2021-03-26 10:13:13,777 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is not cut-off event [2021-03-26 10:13:13,777 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2021-03-26 10:13:13,778 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2021-03-26 10:13:13,778 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2021-03-26 10:13:13,781 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1173] L872-->L879: Formula: (let ((.cse9 (= (mod v_~a$w_buff1_used~0_505 256) 0)) (.cse8 (= (mod v_~a$r_buff1_thd0~0_81 256) 0)) (.cse6 (= (mod v_~a$w_buff0_used~0_663 256) 0)) (.cse7 (= (mod v_~a$r_buff0_thd0~0_107 256) 0))) (let ((.cse0 (or .cse6 .cse7)) (.cse5 (or .cse9 .cse8)) (.cse3 (not .cse9)) (.cse4 (not .cse8)) (.cse1 (not .cse7)) (.cse2 (not .cse6))) (and (not (= v_ULTIMATE.start_assume_abort_if_not_~cond_19 0)) (or (and (= v_~a$w_buff0_used~0_663 v_~a$w_buff0_used~0_662) .cse0) (and (= v_~a$w_buff0_used~0_662 0) .cse1 .cse2)) (or (and .cse3 .cse4 (= v_~a$w_buff1_used~0_504 0)) (and (= v_~a$w_buff1_used~0_505 v_~a$w_buff1_used~0_504) .cse5)) (= v_~a$r_buff0_thd0~0_107 v_~a$r_buff0_thd0~0_106) (= v_ULTIMATE.start_assume_abort_if_not_~cond_19 |v_ULTIMATE.start_assume_abort_if_not_#in~cond_25|) (= v_~a$r_buff1_thd0~0_81 v_~a$r_buff1_thd0~0_80) (or (and .cse0 (= v_~a~0_306 |v_ULTIMATE.start_main_#t~ite56_58|) (or (and .cse5 (= v_~a~0_307 |v_ULTIMATE.start_main_#t~ite56_58|)) (and (= |v_ULTIMATE.start_main_#t~ite56_58| v_~a$w_buff1~0_225) .cse3 .cse4))) (and (= |v_ULTIMATE.start_main_#t~ite56_58| |v_ULTIMATE.start_main_#t~ite56_57|) (= v_~a~0_306 v_~a$w_buff0~0_231) .cse1 .cse2))))) InVars {~a~0=v_~a~0_307, ULTIMATE.start_assume_abort_if_not_#in~cond=|v_ULTIMATE.start_assume_abort_if_not_#in~cond_25|, ~a$w_buff1~0=v_~a$w_buff1~0_225, ~a$w_buff0~0=v_~a$w_buff0~0_231, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_81, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_663, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_107, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_505, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_57|} OutVars{ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_36|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_662, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_44|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_106, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_50|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_56|, ~a~0=v_~a~0_306, ULTIMATE.start_assume_abort_if_not_#in~cond=|v_ULTIMATE.start_assume_abort_if_not_#in~cond_25|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_42|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_38|, ULTIMATE.start_assume_abort_if_not_~cond=v_ULTIMATE.start_assume_abort_if_not_~cond_19, ~a$w_buff1~0=v_~a$w_buff1~0_225, ~a$w_buff0~0=v_~a$w_buff0~0_231, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_80, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_504} AuxVars[|v_ULTIMATE.start_main_#t~ite56_58|] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite58, ~a$r_buff1_thd0~0, ~a$w_buff0_used~0, ULTIMATE.start_main_#t~ite57, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite59, ~a$w_buff1_used~0, ULTIMATE.start_main_#t~ite56][46], [P1Thread1of1ForFork1InUse, 65#P0EXITtrue, P3Thread1of1ForFork3InUse, Black: 159#(<= ~__unbuffered_cnt~0 1), 167#true, Black: 192#(and (= ~a$w_buff1~0 0) (<= 1 ~a$w_buff0_used~0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), 9#P1EXITtrue, Black: 194#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd3~0 0)), Black: 196#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~y~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd3~0 0)), Black: 182#(and (= ~a$w_buff1~0 0) (<= 1 ~a$w_buff0_used~0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 198#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~y~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 183#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 188#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))), 46#L879true, Black: 137#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 171#(<= ~__unbuffered_cnt~0 2), 179#true, 53#P2EXITtrue, Black: 148#(<= ~__unbuffered_cnt~0 0), Black: 151#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), 28#L844true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse]) [2021-03-26 10:13:13,781 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2021-03-26 10:13:13,781 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 10:13:13,781 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 10:13:13,781 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 10:13:13,781 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1157] L844-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_119 (+ v_~__unbuffered_cnt~0_120 1)) (= |v_P3Thread1of1ForFork3_#res.base_11| 0) (= |v_P3Thread1of1ForFork3_#res.offset_11| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_120} OutVars{P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_119, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_11|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset][14], [P1Thread1of1ForFork1InUse, 65#P0EXITtrue, P3Thread1of1ForFork3InUse, 101#L872true, Black: 159#(<= ~__unbuffered_cnt~0 1), 167#true, Black: 192#(and (= ~a$w_buff1~0 0) (<= 1 ~a$w_buff0_used~0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), 9#P1EXITtrue, Black: 194#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd3~0 0)), Black: 196#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~y~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd3~0 0)), Black: 182#(and (= ~a$w_buff1~0 0) (<= 1 ~a$w_buff0_used~0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 198#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~y~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 183#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 188#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))), 110#P3EXITtrue, Black: 137#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 171#(<= ~__unbuffered_cnt~0 2), 179#true, 53#P2EXITtrue, Black: 148#(<= ~__unbuffered_cnt~0 0), Black: 151#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse]) [2021-03-26 10:13:13,781 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2021-03-26 10:13:13,781 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 10:13:13,781 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 10:13:13,781 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 10:13:13,789 INFO L129 PetriNetUnfolder]: 752/1586 cut-off events. [2021-03-26 10:13:13,790 INFO L130 PetriNetUnfolder]: For 1856/2041 co-relation queries the response was YES. [2021-03-26 10:13:13,799 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5177 conditions, 1586 events. 752/1586 cut-off events. For 1856/2041 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 11180 event pairs, 43 based on Foata normal form. 2/1470 useless extension candidates. Maximal degree in co-relation 5155. Up to 528 conditions per place. [2021-03-26 10:13:13,816 INFO L142 LiptonReduction]: Number of co-enabled transitions 1494 [2021-03-26 10:13:14,207 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-26 10:13:14,334 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-26 10:13:14,645 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-26 10:13:14,797 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-26 10:13:14,984 INFO L154 LiptonReduction]: Checked pairs total: 1170 [2021-03-26 10:13:14,984 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:13:14,985 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1343 [2021-03-26 10:13:14,985 INFO L480 AbstractCegarLoop]: Abstraction has has 63 places, 91 transitions, 572 flow [2021-03-26 10:13:14,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 132.2) internal successors, (1322), 10 states have internal predecessors, (1322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:14,986 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:13:14,986 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:13:14,986 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 10:13:14,986 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:13:14,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:13:14,986 INFO L82 PathProgramCache]: Analyzing trace with hash -133605266, now seen corresponding path program 2 times [2021-03-26 10:13:14,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:13:14,987 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478439234] [2021-03-26 10:13:14,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:13:15,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:13:15,033 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:15,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:13:15,034 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:15,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:13:15,037 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:15,038 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:13:15,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:13:15,041 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478439234] [2021-03-26 10:13:15,041 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:13:15,041 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:13:15,041 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183080854] [2021-03-26 10:13:15,042 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:13:15,042 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:13:15,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:13:15,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:13:15,043 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 206 [2021-03-26 10:13:15,044 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 91 transitions, 572 flow. Second operand has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:15,044 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:13:15,044 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 206 [2021-03-26 10:13:15,044 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:13:15,314 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1157] L844-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_119 (+ v_~__unbuffered_cnt~0_120 1)) (= |v_P3Thread1of1ForFork3_#res.base_11| 0) (= |v_P3Thread1of1ForFork3_#res.offset_11| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_120} OutVars{P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_119, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_11|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset][81], [P1Thread1of1ForFork1InUse, 65#P0EXITtrue, P3Thread1of1ForFork3InUse, 37#L868-1true, Black: 159#(<= ~__unbuffered_cnt~0 1), 167#true, Black: 192#(and (= ~a$w_buff1~0 0) (<= 1 ~a$w_buff0_used~0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), 9#P1EXITtrue, Black: 194#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd3~0 0)), Black: 196#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~y~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd3~0 0)), Black: 182#(and (= ~a$w_buff1~0 0) (<= 1 ~a$w_buff0_used~0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 198#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~y~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 183#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 188#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))), 110#P3EXITtrue, Black: 137#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 171#(<= ~__unbuffered_cnt~0 2), 209#(= ~y~0 1), 179#true, 53#P2EXITtrue, Black: 148#(<= ~__unbuffered_cnt~0 0), Black: 151#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse]) [2021-03-26 10:13:15,314 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is not cut-off event [2021-03-26 10:13:15,314 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2021-03-26 10:13:15,314 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2021-03-26 10:13:15,314 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2021-03-26 10:13:15,316 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1157] L844-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_119 (+ v_~__unbuffered_cnt~0_120 1)) (= |v_P3Thread1of1ForFork3_#res.base_11| 0) (= |v_P3Thread1of1ForFork3_#res.offset_11| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_120} OutVars{P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_119, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_11|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset][81], [P1Thread1of1ForFork1InUse, 65#P0EXITtrue, P3Thread1of1ForFork3InUse, 37#L868-1true, Black: 159#(<= ~__unbuffered_cnt~0 1), 167#true, Black: 192#(and (= ~a$w_buff1~0 0) (<= 1 ~a$w_buff0_used~0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), 9#P1EXITtrue, Black: 194#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd3~0 0)), Black: 196#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~y~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd3~0 0)), Black: 182#(and (= ~a$w_buff1~0 0) (<= 1 ~a$w_buff0_used~0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 198#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~y~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 183#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd3~0 0)), 110#P3EXITtrue, Black: 188#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 137#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 171#(<= ~__unbuffered_cnt~0 2), 179#true, 212#(and (= ~y~0 1) (= ~__unbuffered_p1_EAX~0 1)), 53#P2EXITtrue, Black: 148#(<= ~__unbuffered_cnt~0 0), Black: 151#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse]) [2021-03-26 10:13:15,316 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is not cut-off event [2021-03-26 10:13:15,316 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2021-03-26 10:13:15,316 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2021-03-26 10:13:15,316 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2021-03-26 10:13:15,319 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1173] L872-->L879: Formula: (let ((.cse9 (= (mod v_~a$w_buff1_used~0_505 256) 0)) (.cse8 (= (mod v_~a$r_buff1_thd0~0_81 256) 0)) (.cse6 (= (mod v_~a$w_buff0_used~0_663 256) 0)) (.cse7 (= (mod v_~a$r_buff0_thd0~0_107 256) 0))) (let ((.cse0 (or .cse6 .cse7)) (.cse5 (or .cse9 .cse8)) (.cse3 (not .cse9)) (.cse4 (not .cse8)) (.cse1 (not .cse7)) (.cse2 (not .cse6))) (and (not (= v_ULTIMATE.start_assume_abort_if_not_~cond_19 0)) (or (and (= v_~a$w_buff0_used~0_663 v_~a$w_buff0_used~0_662) .cse0) (and (= v_~a$w_buff0_used~0_662 0) .cse1 .cse2)) (or (and .cse3 .cse4 (= v_~a$w_buff1_used~0_504 0)) (and (= v_~a$w_buff1_used~0_505 v_~a$w_buff1_used~0_504) .cse5)) (= v_~a$r_buff0_thd0~0_107 v_~a$r_buff0_thd0~0_106) (= v_ULTIMATE.start_assume_abort_if_not_~cond_19 |v_ULTIMATE.start_assume_abort_if_not_#in~cond_25|) (= v_~a$r_buff1_thd0~0_81 v_~a$r_buff1_thd0~0_80) (or (and .cse0 (= v_~a~0_306 |v_ULTIMATE.start_main_#t~ite56_58|) (or (and .cse5 (= v_~a~0_307 |v_ULTIMATE.start_main_#t~ite56_58|)) (and (= |v_ULTIMATE.start_main_#t~ite56_58| v_~a$w_buff1~0_225) .cse3 .cse4))) (and (= |v_ULTIMATE.start_main_#t~ite56_58| |v_ULTIMATE.start_main_#t~ite56_57|) (= v_~a~0_306 v_~a$w_buff0~0_231) .cse1 .cse2))))) InVars {~a~0=v_~a~0_307, ULTIMATE.start_assume_abort_if_not_#in~cond=|v_ULTIMATE.start_assume_abort_if_not_#in~cond_25|, ~a$w_buff1~0=v_~a$w_buff1~0_225, ~a$w_buff0~0=v_~a$w_buff0~0_231, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_81, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_663, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_107, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_505, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_57|} OutVars{ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_36|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_662, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_44|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_106, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_50|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_56|, ~a~0=v_~a~0_306, ULTIMATE.start_assume_abort_if_not_#in~cond=|v_ULTIMATE.start_assume_abort_if_not_#in~cond_25|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_42|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_38|, ULTIMATE.start_assume_abort_if_not_~cond=v_ULTIMATE.start_assume_abort_if_not_~cond_19, ~a$w_buff1~0=v_~a$w_buff1~0_225, ~a$w_buff0~0=v_~a$w_buff0~0_231, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_80, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_504} AuxVars[|v_ULTIMATE.start_main_#t~ite56_58|] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite58, ~a$r_buff1_thd0~0, ~a$w_buff0_used~0, ULTIMATE.start_main_#t~ite57, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite59, ~a$w_buff1_used~0, ULTIMATE.start_main_#t~ite56][84], [P1Thread1of1ForFork1InUse, 65#P0EXITtrue, P3Thread1of1ForFork3InUse, Black: 159#(<= ~__unbuffered_cnt~0 1), 167#true, Black: 192#(and (= ~a$w_buff1~0 0) (<= 1 ~a$w_buff0_used~0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), 9#P1EXITtrue, Black: 194#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd3~0 0)), Black: 196#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~y~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd3~0 0)), Black: 182#(and (= ~a$w_buff1~0 0) (<= 1 ~a$w_buff0_used~0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 198#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~y~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 183#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 188#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))), 46#L879true, Black: 137#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 171#(<= ~__unbuffered_cnt~0 2), 209#(= ~y~0 1), 179#true, 53#P2EXITtrue, Black: 148#(<= ~__unbuffered_cnt~0 0), Black: 151#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), 28#L844true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse]) [2021-03-26 10:13:15,320 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2021-03-26 10:13:15,320 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 10:13:15,320 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 10:13:15,320 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 10:13:15,321 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1173] L872-->L879: Formula: (let ((.cse9 (= (mod v_~a$w_buff1_used~0_505 256) 0)) (.cse8 (= (mod v_~a$r_buff1_thd0~0_81 256) 0)) (.cse6 (= (mod v_~a$w_buff0_used~0_663 256) 0)) (.cse7 (= (mod v_~a$r_buff0_thd0~0_107 256) 0))) (let ((.cse0 (or .cse6 .cse7)) (.cse5 (or .cse9 .cse8)) (.cse3 (not .cse9)) (.cse4 (not .cse8)) (.cse1 (not .cse7)) (.cse2 (not .cse6))) (and (not (= v_ULTIMATE.start_assume_abort_if_not_~cond_19 0)) (or (and (= v_~a$w_buff0_used~0_663 v_~a$w_buff0_used~0_662) .cse0) (and (= v_~a$w_buff0_used~0_662 0) .cse1 .cse2)) (or (and .cse3 .cse4 (= v_~a$w_buff1_used~0_504 0)) (and (= v_~a$w_buff1_used~0_505 v_~a$w_buff1_used~0_504) .cse5)) (= v_~a$r_buff0_thd0~0_107 v_~a$r_buff0_thd0~0_106) (= v_ULTIMATE.start_assume_abort_if_not_~cond_19 |v_ULTIMATE.start_assume_abort_if_not_#in~cond_25|) (= v_~a$r_buff1_thd0~0_81 v_~a$r_buff1_thd0~0_80) (or (and .cse0 (= v_~a~0_306 |v_ULTIMATE.start_main_#t~ite56_58|) (or (and .cse5 (= v_~a~0_307 |v_ULTIMATE.start_main_#t~ite56_58|)) (and (= |v_ULTIMATE.start_main_#t~ite56_58| v_~a$w_buff1~0_225) .cse3 .cse4))) (and (= |v_ULTIMATE.start_main_#t~ite56_58| |v_ULTIMATE.start_main_#t~ite56_57|) (= v_~a~0_306 v_~a$w_buff0~0_231) .cse1 .cse2))))) InVars {~a~0=v_~a~0_307, ULTIMATE.start_assume_abort_if_not_#in~cond=|v_ULTIMATE.start_assume_abort_if_not_#in~cond_25|, ~a$w_buff1~0=v_~a$w_buff1~0_225, ~a$w_buff0~0=v_~a$w_buff0~0_231, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_81, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_663, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_107, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_505, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_57|} OutVars{ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_36|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_662, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_44|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_106, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_50|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_56|, ~a~0=v_~a~0_306, ULTIMATE.start_assume_abort_if_not_#in~cond=|v_ULTIMATE.start_assume_abort_if_not_#in~cond_25|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_42|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_38|, ULTIMATE.start_assume_abort_if_not_~cond=v_ULTIMATE.start_assume_abort_if_not_~cond_19, ~a$w_buff1~0=v_~a$w_buff1~0_225, ~a$w_buff0~0=v_~a$w_buff0~0_231, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_80, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_504} AuxVars[|v_ULTIMATE.start_main_#t~ite56_58|] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite58, ~a$r_buff1_thd0~0, ~a$w_buff0_used~0, ULTIMATE.start_main_#t~ite57, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite59, ~a$w_buff1_used~0, ULTIMATE.start_main_#t~ite56][84], [P1Thread1of1ForFork1InUse, 65#P0EXITtrue, P3Thread1of1ForFork3InUse, Black: 159#(<= ~__unbuffered_cnt~0 1), 167#true, Black: 192#(and (= ~a$w_buff1~0 0) (<= 1 ~a$w_buff0_used~0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), 9#P1EXITtrue, Black: 194#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd3~0 0)), Black: 196#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~y~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd3~0 0)), Black: 182#(and (= ~a$w_buff1~0 0) (<= 1 ~a$w_buff0_used~0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 198#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~y~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 183#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd3~0 0)), 46#L879true, Black: 188#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 137#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 171#(<= ~__unbuffered_cnt~0 2), 179#true, 212#(and (= ~y~0 1) (= ~__unbuffered_p1_EAX~0 1)), 53#P2EXITtrue, Black: 148#(<= ~__unbuffered_cnt~0 0), Black: 151#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), 28#L844true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse]) [2021-03-26 10:13:15,321 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2021-03-26 10:13:15,321 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 10:13:15,321 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 10:13:15,321 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 10:13:15,329 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1157] L844-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_119 (+ v_~__unbuffered_cnt~0_120 1)) (= |v_P3Thread1of1ForFork3_#res.base_11| 0) (= |v_P3Thread1of1ForFork3_#res.offset_11| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_120} OutVars{P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_119, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_11|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset][81], [P1Thread1of1ForFork1InUse, 65#P0EXITtrue, P3Thread1of1ForFork3InUse, 101#L872true, Black: 159#(<= ~__unbuffered_cnt~0 1), 167#true, Black: 192#(and (= ~a$w_buff1~0 0) (<= 1 ~a$w_buff0_used~0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), 9#P1EXITtrue, Black: 194#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd3~0 0)), Black: 196#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~y~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd3~0 0)), Black: 182#(and (= ~a$w_buff1~0 0) (<= 1 ~a$w_buff0_used~0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 198#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~y~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 183#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 188#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))), 110#P3EXITtrue, Black: 137#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 171#(<= ~__unbuffered_cnt~0 2), 209#(= ~y~0 1), 179#true, 53#P2EXITtrue, Black: 148#(<= ~__unbuffered_cnt~0 0), Black: 151#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse]) [2021-03-26 10:13:15,329 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is not cut-off event [2021-03-26 10:13:15,329 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2021-03-26 10:13:15,329 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2021-03-26 10:13:15,329 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2021-03-26 10:13:15,330 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1157] L844-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_119 (+ v_~__unbuffered_cnt~0_120 1)) (= |v_P3Thread1of1ForFork3_#res.base_11| 0) (= |v_P3Thread1of1ForFork3_#res.offset_11| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_120} OutVars{P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_119, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_11|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset][81], [P1Thread1of1ForFork1InUse, 65#P0EXITtrue, P3Thread1of1ForFork3InUse, 101#L872true, Black: 159#(<= ~__unbuffered_cnt~0 1), 167#true, Black: 192#(and (= ~a$w_buff1~0 0) (<= 1 ~a$w_buff0_used~0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), 9#P1EXITtrue, Black: 194#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd3~0 0)), Black: 196#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~y~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd3~0 0)), Black: 182#(and (= ~a$w_buff1~0 0) (<= 1 ~a$w_buff0_used~0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 198#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~y~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 183#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 188#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))), 110#P3EXITtrue, Black: 137#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 171#(<= ~__unbuffered_cnt~0 2), 179#true, 212#(and (= ~y~0 1) (= ~__unbuffered_p1_EAX~0 1)), 53#P2EXITtrue, Black: 148#(<= ~__unbuffered_cnt~0 0), Black: 151#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse]) [2021-03-26 10:13:15,331 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is not cut-off event [2021-03-26 10:13:15,331 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2021-03-26 10:13:15,331 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2021-03-26 10:13:15,331 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2021-03-26 10:13:15,337 INFO L129 PetriNetUnfolder]: 1147/2407 cut-off events. [2021-03-26 10:13:15,337 INFO L130 PetriNetUnfolder]: For 3129/3411 co-relation queries the response was YES. [2021-03-26 10:13:15,352 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7917 conditions, 2407 events. 1147/2407 cut-off events. For 3129/3411 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 18583 event pairs, 75 based on Foata normal form. 16/2236 useless extension candidates. Maximal degree in co-relation 7893. Up to 857 conditions per place. [2021-03-26 10:13:15,363 INFO L132 encePairwiseOnDemand]: 201/206 looper letters, 9 selfloop transitions, 9 changer transitions 2/96 dead transitions. [2021-03-26 10:13:15,363 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 96 transitions, 643 flow [2021-03-26 10:13:15,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:13:15,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:13:15,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 707 transitions. [2021-03-26 10:13:15,365 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8580097087378641 [2021-03-26 10:13:15,365 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 707 transitions. [2021-03-26 10:13:15,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 707 transitions. [2021-03-26 10:13:15,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:13:15,366 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 707 transitions. [2021-03-26 10:13:15,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 176.75) internal successors, (707), 4 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:15,369 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:15,369 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:15,369 INFO L185 Difference]: Start difference. First operand has 63 places, 91 transitions, 572 flow. Second operand 4 states and 707 transitions. [2021-03-26 10:13:15,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 96 transitions, 643 flow [2021-03-26 10:13:15,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 96 transitions, 639 flow, removed 2 selfloop flow, removed 0 redundant places. [2021-03-26 10:13:15,414 INFO L241 Difference]: Finished difference. Result has 68 places, 93 transitions, 630 flow [2021-03-26 10:13:15,415 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=630, PETRI_PLACES=68, PETRI_TRANSITIONS=93} [2021-03-26 10:13:15,415 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 10 predicate places. [2021-03-26 10:13:15,415 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:13:15,415 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 93 transitions, 630 flow [2021-03-26 10:13:15,415 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 93 transitions, 630 flow [2021-03-26 10:13:15,416 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 68 places, 93 transitions, 630 flow [2021-03-26 10:13:15,622 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1157] L844-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_119 (+ v_~__unbuffered_cnt~0_120 1)) (= |v_P3Thread1of1ForFork3_#res.base_11| 0) (= |v_P3Thread1of1ForFork3_#res.offset_11| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_120} OutVars{P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_119, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_11|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset][15], [P1Thread1of1ForFork1InUse, 65#P0EXITtrue, P3Thread1of1ForFork3InUse, Black: 192#(and (= ~a$w_buff1~0 0) (<= 1 ~a$w_buff0_used~0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), 9#P1EXITtrue, Black: 194#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd3~0 0)), Black: 196#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~y~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd3~0 0)), Black: 182#(and (= ~a$w_buff1~0 0) (<= 1 ~a$w_buff0_used~0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 198#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~y~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 183#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 188#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 137#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))), 212#(and (= ~y~0 1) (= ~__unbuffered_p1_EAX~0 1)), Black: 209#(= ~y~0 1), Black: 148#(<= ~__unbuffered_cnt~0 0), Black: 151#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), 37#L868-1true, Black: 159#(<= ~__unbuffered_cnt~0 1), 167#true, 110#P3EXITtrue, Black: 171#(<= ~__unbuffered_cnt~0 2), 179#true, 53#P2EXITtrue, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse]) [2021-03-26 10:13:15,623 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is not cut-off event [2021-03-26 10:13:15,623 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2021-03-26 10:13:15,623 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2021-03-26 10:13:15,623 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2021-03-26 10:13:15,626 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1173] L872-->L879: Formula: (let ((.cse9 (= (mod v_~a$w_buff1_used~0_505 256) 0)) (.cse8 (= (mod v_~a$r_buff1_thd0~0_81 256) 0)) (.cse6 (= (mod v_~a$w_buff0_used~0_663 256) 0)) (.cse7 (= (mod v_~a$r_buff0_thd0~0_107 256) 0))) (let ((.cse0 (or .cse6 .cse7)) (.cse5 (or .cse9 .cse8)) (.cse3 (not .cse9)) (.cse4 (not .cse8)) (.cse1 (not .cse7)) (.cse2 (not .cse6))) (and (not (= v_ULTIMATE.start_assume_abort_if_not_~cond_19 0)) (or (and (= v_~a$w_buff0_used~0_663 v_~a$w_buff0_used~0_662) .cse0) (and (= v_~a$w_buff0_used~0_662 0) .cse1 .cse2)) (or (and .cse3 .cse4 (= v_~a$w_buff1_used~0_504 0)) (and (= v_~a$w_buff1_used~0_505 v_~a$w_buff1_used~0_504) .cse5)) (= v_~a$r_buff0_thd0~0_107 v_~a$r_buff0_thd0~0_106) (= v_ULTIMATE.start_assume_abort_if_not_~cond_19 |v_ULTIMATE.start_assume_abort_if_not_#in~cond_25|) (= v_~a$r_buff1_thd0~0_81 v_~a$r_buff1_thd0~0_80) (or (and .cse0 (= v_~a~0_306 |v_ULTIMATE.start_main_#t~ite56_58|) (or (and .cse5 (= v_~a~0_307 |v_ULTIMATE.start_main_#t~ite56_58|)) (and (= |v_ULTIMATE.start_main_#t~ite56_58| v_~a$w_buff1~0_225) .cse3 .cse4))) (and (= |v_ULTIMATE.start_main_#t~ite56_58| |v_ULTIMATE.start_main_#t~ite56_57|) (= v_~a~0_306 v_~a$w_buff0~0_231) .cse1 .cse2))))) InVars {~a~0=v_~a~0_307, ULTIMATE.start_assume_abort_if_not_#in~cond=|v_ULTIMATE.start_assume_abort_if_not_#in~cond_25|, ~a$w_buff1~0=v_~a$w_buff1~0_225, ~a$w_buff0~0=v_~a$w_buff0~0_231, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_81, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_663, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_107, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_505, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_57|} OutVars{ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_36|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_662, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_44|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_106, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_50|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_56|, ~a~0=v_~a~0_306, ULTIMATE.start_assume_abort_if_not_#in~cond=|v_ULTIMATE.start_assume_abort_if_not_#in~cond_25|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_42|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_38|, ULTIMATE.start_assume_abort_if_not_~cond=v_ULTIMATE.start_assume_abort_if_not_~cond_19, ~a$w_buff1~0=v_~a$w_buff1~0_225, ~a$w_buff0~0=v_~a$w_buff0~0_231, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_80, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_504} AuxVars[|v_ULTIMATE.start_main_#t~ite56_58|] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite58, ~a$r_buff1_thd0~0, ~a$w_buff0_used~0, ULTIMATE.start_main_#t~ite57, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite59, ~a$w_buff1_used~0, ULTIMATE.start_main_#t~ite56][50], [P1Thread1of1ForFork1InUse, 65#P0EXITtrue, P3Thread1of1ForFork3InUse, Black: 192#(and (= ~a$w_buff1~0 0) (<= 1 ~a$w_buff0_used~0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), 9#P1EXITtrue, Black: 194#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd3~0 0)), Black: 196#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~y~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd3~0 0)), Black: 182#(and (= ~a$w_buff1~0 0) (<= 1 ~a$w_buff0_used~0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 198#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~y~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 183#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 188#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 137#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))), 212#(and (= ~y~0 1) (= ~__unbuffered_p1_EAX~0 1)), Black: 209#(= ~y~0 1), Black: 148#(<= ~__unbuffered_cnt~0 0), Black: 151#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), 28#L844true, Black: 159#(<= ~__unbuffered_cnt~0 1), 167#true, 46#L879true, Black: 171#(<= ~__unbuffered_cnt~0 2), 179#true, 53#P2EXITtrue, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse]) [2021-03-26 10:13:15,627 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2021-03-26 10:13:15,627 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 10:13:15,627 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 10:13:15,627 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 10:13:15,627 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1157] L844-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_119 (+ v_~__unbuffered_cnt~0_120 1)) (= |v_P3Thread1of1ForFork3_#res.base_11| 0) (= |v_P3Thread1of1ForFork3_#res.offset_11| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_120} OutVars{P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_119, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_11|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset][15], [P1Thread1of1ForFork1InUse, 65#P0EXITtrue, P3Thread1of1ForFork3InUse, Black: 192#(and (= ~a$w_buff1~0 0) (<= 1 ~a$w_buff0_used~0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), 9#P1EXITtrue, Black: 194#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd3~0 0)), Black: 196#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~y~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd3~0 0)), Black: 182#(and (= ~a$w_buff1~0 0) (<= 1 ~a$w_buff0_used~0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 198#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~y~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 183#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 188#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 137#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))), 212#(and (= ~y~0 1) (= ~__unbuffered_p1_EAX~0 1)), Black: 209#(= ~y~0 1), Black: 148#(<= ~__unbuffered_cnt~0 0), Black: 151#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), 101#L872true, Black: 159#(<= ~__unbuffered_cnt~0 1), 167#true, 110#P3EXITtrue, Black: 171#(<= ~__unbuffered_cnt~0 2), 179#true, 53#P2EXITtrue, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse]) [2021-03-26 10:13:15,627 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2021-03-26 10:13:15,627 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 10:13:15,627 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 10:13:15,627 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 10:13:15,642 INFO L129 PetriNetUnfolder]: 1237/2516 cut-off events. [2021-03-26 10:13:15,642 INFO L130 PetriNetUnfolder]: For 3443/3730 co-relation queries the response was YES. [2021-03-26 10:13:15,658 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8352 conditions, 2516 events. 1237/2516 cut-off events. For 3443/3730 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 18937 event pairs, 64 based on Foata normal form. 2/2302 useless extension candidates. Maximal degree in co-relation 8327. Up to 922 conditions per place. [2021-03-26 10:13:15,720 INFO L142 LiptonReduction]: Number of co-enabled transitions 1524 [2021-03-26 10:13:16,218 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-26 10:13:16,368 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-26 10:13:16,618 INFO L154 LiptonReduction]: Checked pairs total: 783 [2021-03-26 10:13:16,619 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:13:16,619 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1204 [2021-03-26 10:13:16,619 INFO L480 AbstractCegarLoop]: Abstraction has has 68 places, 92 transitions, 628 flow [2021-03-26 10:13:16,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:16,620 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:13:16,620 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 10:13:16,620 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 10:13:16,620 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:13:16,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:13:16,620 INFO L82 PathProgramCache]: Analyzing trace with hash -48705047, now seen corresponding path program 1 times [2021-03-26 10:13:16,620 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:13:16,620 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521138841] [2021-03-26 10:13:16,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:13:16,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:13:16,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:16,692 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:13:16,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:16,693 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:13:16,695 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:16,695 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:13:16,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:13:16,698 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521138841] [2021-03-26 10:13:16,698 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:13:16,698 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:13:16,698 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866424526] [2021-03-26 10:13:16,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:13:16,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:13:16,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:13:16,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:13:16,700 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 207 [2021-03-26 10:13:16,701 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 92 transitions, 628 flow. Second operand has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:16,701 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:13:16,701 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 207 [2021-03-26 10:13:16,701 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:13:17,074 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1157] L844-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_119 (+ v_~__unbuffered_cnt~0_120 1)) (= |v_P3Thread1of1ForFork3_#res.base_11| 0) (= |v_P3Thread1of1ForFork3_#res.offset_11| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_120} OutVars{P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_119, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_11|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset][87], [P1Thread1of1ForFork1InUse, 65#P0EXITtrue, P3Thread1of1ForFork3InUse, Black: 192#(and (= ~a$w_buff1~0 0) (<= 1 ~a$w_buff0_used~0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), 9#P1EXITtrue, Black: 194#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd3~0 0)), Black: 196#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~y~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd3~0 0)), Black: 182#(and (= ~a$w_buff1~0 0) (<= 1 ~a$w_buff0_used~0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 198#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~y~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 183#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 188#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 137#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))), 209#(= ~y~0 1), Black: 212#(and (= ~y~0 1) (= ~__unbuffered_p1_EAX~0 1)), Black: 148#(<= ~__unbuffered_cnt~0 0), Black: 151#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), 221#(and (= ~__unbuffered_p2_EAX~0 1) (= ~z~0 1)), 37#L868-1true, Black: 159#(<= ~__unbuffered_cnt~0 1), 167#true, 110#P3EXITtrue, Black: 171#(<= ~__unbuffered_cnt~0 2), 179#true, 53#P2EXITtrue, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse]) [2021-03-26 10:13:17,074 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is not cut-off event [2021-03-26 10:13:17,074 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2021-03-26 10:13:17,074 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2021-03-26 10:13:17,074 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2021-03-26 10:13:17,083 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1173] L872-->L879: Formula: (let ((.cse9 (= (mod v_~a$w_buff1_used~0_505 256) 0)) (.cse8 (= (mod v_~a$r_buff1_thd0~0_81 256) 0)) (.cse6 (= (mod v_~a$w_buff0_used~0_663 256) 0)) (.cse7 (= (mod v_~a$r_buff0_thd0~0_107 256) 0))) (let ((.cse0 (or .cse6 .cse7)) (.cse5 (or .cse9 .cse8)) (.cse3 (not .cse9)) (.cse4 (not .cse8)) (.cse1 (not .cse7)) (.cse2 (not .cse6))) (and (not (= v_ULTIMATE.start_assume_abort_if_not_~cond_19 0)) (or (and (= v_~a$w_buff0_used~0_663 v_~a$w_buff0_used~0_662) .cse0) (and (= v_~a$w_buff0_used~0_662 0) .cse1 .cse2)) (or (and .cse3 .cse4 (= v_~a$w_buff1_used~0_504 0)) (and (= v_~a$w_buff1_used~0_505 v_~a$w_buff1_used~0_504) .cse5)) (= v_~a$r_buff0_thd0~0_107 v_~a$r_buff0_thd0~0_106) (= v_ULTIMATE.start_assume_abort_if_not_~cond_19 |v_ULTIMATE.start_assume_abort_if_not_#in~cond_25|) (= v_~a$r_buff1_thd0~0_81 v_~a$r_buff1_thd0~0_80) (or (and .cse0 (= v_~a~0_306 |v_ULTIMATE.start_main_#t~ite56_58|) (or (and .cse5 (= v_~a~0_307 |v_ULTIMATE.start_main_#t~ite56_58|)) (and (= |v_ULTIMATE.start_main_#t~ite56_58| v_~a$w_buff1~0_225) .cse3 .cse4))) (and (= |v_ULTIMATE.start_main_#t~ite56_58| |v_ULTIMATE.start_main_#t~ite56_57|) (= v_~a~0_306 v_~a$w_buff0~0_231) .cse1 .cse2))))) InVars {~a~0=v_~a~0_307, ULTIMATE.start_assume_abort_if_not_#in~cond=|v_ULTIMATE.start_assume_abort_if_not_#in~cond_25|, ~a$w_buff1~0=v_~a$w_buff1~0_225, ~a$w_buff0~0=v_~a$w_buff0~0_231, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_81, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_663, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_107, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_505, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_57|} OutVars{ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_36|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_662, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_44|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_106, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_50|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_56|, ~a~0=v_~a~0_306, ULTIMATE.start_assume_abort_if_not_#in~cond=|v_ULTIMATE.start_assume_abort_if_not_#in~cond_25|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_42|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_38|, ULTIMATE.start_assume_abort_if_not_~cond=v_ULTIMATE.start_assume_abort_if_not_~cond_19, ~a$w_buff1~0=v_~a$w_buff1~0_225, ~a$w_buff0~0=v_~a$w_buff0~0_231, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_80, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_504} AuxVars[|v_ULTIMATE.start_main_#t~ite56_58|] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite58, ~a$r_buff1_thd0~0, ~a$w_buff0_used~0, ULTIMATE.start_main_#t~ite57, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite59, ~a$w_buff1_used~0, ULTIMATE.start_main_#t~ite56][90], [P1Thread1of1ForFork1InUse, 65#P0EXITtrue, P3Thread1of1ForFork3InUse, Black: 192#(and (= ~a$w_buff1~0 0) (<= 1 ~a$w_buff0_used~0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), 9#P1EXITtrue, Black: 194#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd3~0 0)), Black: 196#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~y~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd3~0 0)), Black: 182#(and (= ~a$w_buff1~0 0) (<= 1 ~a$w_buff0_used~0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 198#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~y~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 183#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 188#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 137#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))), 209#(= ~y~0 1), Black: 212#(and (= ~y~0 1) (= ~__unbuffered_p1_EAX~0 1)), Black: 148#(<= ~__unbuffered_cnt~0 0), Black: 151#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), 28#L844true, 221#(and (= ~__unbuffered_p2_EAX~0 1) (= ~z~0 1)), Black: 159#(<= ~__unbuffered_cnt~0 1), 167#true, 46#L879true, Black: 171#(<= ~__unbuffered_cnt~0 2), 179#true, 53#P2EXITtrue, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse]) [2021-03-26 10:13:17,083 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2021-03-26 10:13:17,083 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 10:13:17,083 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 10:13:17,084 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 10:13:17,096 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1157] L844-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_119 (+ v_~__unbuffered_cnt~0_120 1)) (= |v_P3Thread1of1ForFork3_#res.base_11| 0) (= |v_P3Thread1of1ForFork3_#res.offset_11| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_120} OutVars{P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_119, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_11|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset][87], [P1Thread1of1ForFork1InUse, 65#P0EXITtrue, P3Thread1of1ForFork3InUse, Black: 192#(and (= ~a$w_buff1~0 0) (<= 1 ~a$w_buff0_used~0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), 9#P1EXITtrue, Black: 194#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd3~0 0)), Black: 196#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~y~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd3~0 0)), Black: 182#(and (= ~a$w_buff1~0 0) (<= 1 ~a$w_buff0_used~0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 198#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~y~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 183#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 188#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 137#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))), 209#(= ~y~0 1), Black: 212#(and (= ~y~0 1) (= ~__unbuffered_p1_EAX~0 1)), Black: 148#(<= ~__unbuffered_cnt~0 0), Black: 151#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), 221#(and (= ~__unbuffered_p2_EAX~0 1) (= ~z~0 1)), 101#L872true, Black: 159#(<= ~__unbuffered_cnt~0 1), 167#true, 110#P3EXITtrue, Black: 171#(<= ~__unbuffered_cnt~0 2), 179#true, 53#P2EXITtrue, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse]) [2021-03-26 10:13:17,096 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is not cut-off event [2021-03-26 10:13:17,096 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2021-03-26 10:13:17,096 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2021-03-26 10:13:17,096 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2021-03-26 10:13:17,107 INFO L129 PetriNetUnfolder]: 1687/3554 cut-off events. [2021-03-26 10:13:17,107 INFO L130 PetriNetUnfolder]: For 5520/5906 co-relation queries the response was YES. [2021-03-26 10:13:17,130 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11884 conditions, 3554 events. 1687/3554 cut-off events. For 5520/5906 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 29985 event pairs, 94 based on Foata normal form. 33/3334 useless extension candidates. Maximal degree in co-relation 11857. Up to 1310 conditions per place. [2021-03-26 10:13:17,145 INFO L132 encePairwiseOnDemand]: 202/207 looper letters, 11 selfloop transitions, 8 changer transitions 1/100 dead transitions. [2021-03-26 10:13:17,145 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 100 transitions, 729 flow [2021-03-26 10:13:17,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:13:17,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:13:17,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 711 transitions. [2021-03-26 10:13:17,148 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8586956521739131 [2021-03-26 10:13:17,148 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 711 transitions. [2021-03-26 10:13:17,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 711 transitions. [2021-03-26 10:13:17,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:13:17,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 711 transitions. [2021-03-26 10:13:17,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 177.75) internal successors, (711), 4 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:17,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:17,152 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:17,152 INFO L185 Difference]: Start difference. First operand has 68 places, 92 transitions, 628 flow. Second operand 4 states and 711 transitions. [2021-03-26 10:13:17,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 100 transitions, 729 flow [2021-03-26 10:13:17,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 100 transitions, 726 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:13:17,236 INFO L241 Difference]: Finished difference. Result has 72 places, 98 transitions, 719 flow [2021-03-26 10:13:17,236 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=719, PETRI_PLACES=72, PETRI_TRANSITIONS=98} [2021-03-26 10:13:17,236 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 14 predicate places. [2021-03-26 10:13:17,236 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:13:17,236 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 98 transitions, 719 flow [2021-03-26 10:13:17,237 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 98 transitions, 719 flow [2021-03-26 10:13:17,237 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 72 places, 98 transitions, 719 flow [2021-03-26 10:13:17,549 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1149] L811-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#res.offset_7| 0) (= |v_P2Thread1of1ForFork2_#res.base_7| 0) (= v_~__unbuffered_cnt~0_103 (+ v_~__unbuffered_cnt~0_104 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_104} OutVars{P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset][8], [P1Thread1of1ForFork1InUse, 65#P0EXITtrue, P3Thread1of1ForFork3InUse, Black: 192#(and (= ~a$w_buff1~0 0) (<= 1 ~a$w_buff0_used~0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), 9#P1EXITtrue, Black: 194#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd3~0 0)), Black: 196#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~y~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd3~0 0)), Black: 182#(and (= ~a$w_buff1~0 0) (<= 1 ~a$w_buff0_used~0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 198#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~y~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 183#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 188#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 137#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))), 209#(= ~y~0 1), Black: 212#(and (= ~y~0 1) (= ~__unbuffered_p1_EAX~0 1)), Black: 148#(<= ~__unbuffered_cnt~0 0), Black: 151#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), 221#(and (= ~__unbuffered_p2_EAX~0 1) (= ~z~0 1)), Black: 218#(= ~z~0 1), 37#L868-1true, Black: 159#(<= ~__unbuffered_cnt~0 1), 167#true, 110#P3EXITtrue, Black: 171#(<= ~__unbuffered_cnt~0 2), 179#true, 53#P2EXITtrue, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse]) [2021-03-26 10:13:17,549 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-03-26 10:13:17,549 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-26 10:13:17,549 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-26 10:13:17,549 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-26 10:13:17,566 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1149] L811-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#res.offset_7| 0) (= |v_P2Thread1of1ForFork2_#res.base_7| 0) (= v_~__unbuffered_cnt~0_103 (+ v_~__unbuffered_cnt~0_104 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_104} OutVars{P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset][6], [P1Thread1of1ForFork1InUse, 65#P0EXITtrue, P3Thread1of1ForFork3InUse, Black: 192#(and (= ~a$w_buff1~0 0) (<= 1 ~a$w_buff0_used~0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), 9#P1EXITtrue, Black: 194#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd3~0 0)), Black: 196#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~y~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd3~0 0)), Black: 182#(and (= ~a$w_buff1~0 0) (<= 1 ~a$w_buff0_used~0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 198#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~y~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 183#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 188#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 137#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))), 212#(and (= ~y~0 1) (= ~__unbuffered_p1_EAX~0 1)), Black: 209#(= ~y~0 1), Black: 148#(<= ~__unbuffered_cnt~0 0), Black: 151#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), 28#L844true, 221#(and (= ~__unbuffered_p2_EAX~0 1) (= ~z~0 1)), Black: 218#(= ~z~0 1), 37#L868-1true, Black: 159#(<= ~__unbuffered_cnt~0 1), 167#true, Black: 171#(<= ~__unbuffered_cnt~0 2), 179#true, 53#P2EXITtrue, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse]) [2021-03-26 10:13:17,566 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is not cut-off event [2021-03-26 10:13:17,566 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2021-03-26 10:13:17,566 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2021-03-26 10:13:17,566 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2021-03-26 10:13:17,574 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1149] L811-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#res.offset_7| 0) (= |v_P2Thread1of1ForFork2_#res.base_7| 0) (= v_~__unbuffered_cnt~0_103 (+ v_~__unbuffered_cnt~0_104 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_104} OutVars{P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset][8], [P1Thread1of1ForFork1InUse, 65#P0EXITtrue, P3Thread1of1ForFork3InUse, Black: 192#(and (= ~a$w_buff1~0 0) (<= 1 ~a$w_buff0_used~0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), 9#P1EXITtrue, Black: 194#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd3~0 0)), Black: 196#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~y~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd3~0 0)), Black: 182#(and (= ~a$w_buff1~0 0) (<= 1 ~a$w_buff0_used~0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 198#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~y~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 183#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 188#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 137#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))), 209#(= ~y~0 1), Black: 212#(and (= ~y~0 1) (= ~__unbuffered_p1_EAX~0 1)), Black: 148#(<= ~__unbuffered_cnt~0 0), Black: 151#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), 221#(and (= ~__unbuffered_p2_EAX~0 1) (= ~z~0 1)), Black: 218#(= ~z~0 1), 101#L872true, Black: 159#(<= ~__unbuffered_cnt~0 1), 167#true, 110#P3EXITtrue, Black: 171#(<= ~__unbuffered_cnt~0 2), 179#true, 53#P2EXITtrue, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse]) [2021-03-26 10:13:17,575 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2021-03-26 10:13:17,575 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 10:13:17,575 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 10:13:17,575 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 10:13:17,575 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1149] L811-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#res.offset_7| 0) (= |v_P2Thread1of1ForFork2_#res.base_7| 0) (= v_~__unbuffered_cnt~0_103 (+ v_~__unbuffered_cnt~0_104 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_104} OutVars{P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset][6], [P1Thread1of1ForFork1InUse, 65#P0EXITtrue, P3Thread1of1ForFork3InUse, Black: 192#(and (= ~a$w_buff1~0 0) (<= 1 ~a$w_buff0_used~0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), 9#P1EXITtrue, Black: 194#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd3~0 0)), Black: 196#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~y~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd3~0 0)), Black: 182#(and (= ~a$w_buff1~0 0) (<= 1 ~a$w_buff0_used~0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 198#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~y~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 183#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 188#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 137#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))), 209#(= ~y~0 1), Black: 212#(and (= ~y~0 1) (= ~__unbuffered_p1_EAX~0 1)), Black: 148#(<= ~__unbuffered_cnt~0 0), Black: 151#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), 28#L844true, 221#(and (= ~__unbuffered_p2_EAX~0 1) (= ~z~0 1)), Black: 218#(= ~z~0 1), 37#L868-1true, Black: 159#(<= ~__unbuffered_cnt~0 1), 167#true, Black: 171#(<= ~__unbuffered_cnt~0 2), 179#true, 53#P2EXITtrue, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse]) [2021-03-26 10:13:17,575 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is not cut-off event [2021-03-26 10:13:17,575 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2021-03-26 10:13:17,575 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2021-03-26 10:13:17,575 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2021-03-26 10:13:17,621 INFO L129 PetriNetUnfolder]: 1831/3741 cut-off events. [2021-03-26 10:13:17,621 INFO L130 PetriNetUnfolder]: For 5846/6181 co-relation queries the response was YES. [2021-03-26 10:13:17,645 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12581 conditions, 3741 events. 1831/3741 cut-off events. For 5846/6181 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 31038 event pairs, 93 based on Foata normal form. 12/3450 useless extension candidates. Maximal degree in co-relation 12554. Up to 1422 conditions per place. [2021-03-26 10:13:17,689 INFO L142 LiptonReduction]: Number of co-enabled transitions 1550 [2021-03-26 10:13:18,161 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-26 10:13:18,294 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-26 10:13:18,926 WARN L205 SmtUtils]: Spent 605.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-26 10:13:19,419 WARN L205 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 175 [2021-03-26 10:13:20,601 WARN L205 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-26 10:13:21,189 WARN L205 SmtUtils]: Spent 587.00 ms on a formula simplification that was a NOOP. DAG size: 255 [2021-03-26 10:13:22,562 INFO L154 LiptonReduction]: Checked pairs total: 274 [2021-03-26 10:13:22,563 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:13:22,563 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5327 [2021-03-26 10:13:22,563 INFO L480 AbstractCegarLoop]: Abstraction has has 72 places, 98 transitions, 730 flow [2021-03-26 10:13:22,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:22,564 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:13:22,564 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:13:22,564 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 10:13:22,564 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:13:22,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:13:22,564 INFO L82 PathProgramCache]: Analyzing trace with hash -121936924, now seen corresponding path program 1 times [2021-03-26 10:13:22,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:13:22,565 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558568831] [2021-03-26 10:13:22,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:13:22,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:13:22,647 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:22,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:13:22,654 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:22,655 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:13:22,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:22,658 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:13:22,662 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:22,663 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:13:22,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:13:22,668 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558568831] [2021-03-26 10:13:22,668 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:13:22,668 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:13:22,668 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245045455] [2021-03-26 10:13:22,669 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:13:22,669 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:13:22,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:13:22,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:13:22,670 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 209 [2021-03-26 10:13:22,671 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 98 transitions, 730 flow. Second operand has 6 states, 6 states have (on average 179.83333333333334) internal successors, (1079), 6 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:22,672 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:13:22,672 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 209 [2021-03-26 10:13:22,672 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:13:23,127 INFO L129 PetriNetUnfolder]: 1621/3490 cut-off events. [2021-03-26 10:13:23,128 INFO L130 PetriNetUnfolder]: For 7397/9560 co-relation queries the response was YES. [2021-03-26 10:13:23,147 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13966 conditions, 3490 events. 1621/3490 cut-off events. For 7397/9560 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 29998 event pairs, 73 based on Foata normal form. 775/3993 useless extension candidates. Maximal degree in co-relation 13937. Up to 1300 conditions per place. [2021-03-26 10:13:23,170 INFO L132 encePairwiseOnDemand]: 203/209 looper letters, 2 selfloop transitions, 17 changer transitions 0/97 dead transitions. [2021-03-26 10:13:23,170 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 97 transitions, 744 flow [2021-03-26 10:13:23,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:13:23,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:13:23,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1094 transitions. [2021-03-26 10:13:23,173 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8724082934609251 [2021-03-26 10:13:23,173 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1094 transitions. [2021-03-26 10:13:23,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1094 transitions. [2021-03-26 10:13:23,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:13:23,174 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1094 transitions. [2021-03-26 10:13:23,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 182.33333333333334) internal successors, (1094), 6 states have internal predecessors, (1094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:23,178 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 209.0) internal successors, (1463), 7 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:23,179 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 209.0) internal successors, (1463), 7 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:23,179 INFO L185 Difference]: Start difference. First operand has 72 places, 98 transitions, 730 flow. Second operand 6 states and 1094 transitions. [2021-03-26 10:13:23,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 97 transitions, 744 flow [2021-03-26 10:13:23,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 97 transitions, 742 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:13:23,262 INFO L241 Difference]: Finished difference. Result has 76 places, 96 transitions, 730 flow [2021-03-26 10:13:23,262 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=730, PETRI_PLACES=76, PETRI_TRANSITIONS=96} [2021-03-26 10:13:23,262 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 18 predicate places. [2021-03-26 10:13:23,262 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:13:23,262 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 96 transitions, 730 flow [2021-03-26 10:13:23,262 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 96 transitions, 730 flow [2021-03-26 10:13:23,263 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 76 places, 96 transitions, 730 flow [2021-03-26 10:13:23,455 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1149] L811-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#res.offset_7| 0) (= |v_P2Thread1of1ForFork2_#res.base_7| 0) (= v_~__unbuffered_cnt~0_103 (+ v_~__unbuffered_cnt~0_104 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_104} OutVars{P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset][81], [P1Thread1of1ForFork1InUse, 65#P0EXITtrue, P3Thread1of1ForFork3InUse, Black: 192#(and (= ~a$w_buff1~0 0) (<= 1 ~a$w_buff0_used~0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 194#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd3~0 0)), 9#P1EXITtrue, Black: 196#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~y~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd3~0 0)), Black: 182#(and (= ~a$w_buff1~0 0) (<= 1 ~a$w_buff0_used~0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 198#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~y~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 183#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 188#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 137#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))), 209#(= ~y~0 1), Black: 212#(and (= ~y~0 1) (= ~__unbuffered_p1_EAX~0 1)), Black: 148#(<= ~__unbuffered_cnt~0 0), Black: 151#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), 221#(and (= ~__unbuffered_p2_EAX~0 1) (= ~z~0 1)), Black: 218#(= ~z~0 1), 225#true, 37#L868-1true, Black: 159#(<= ~__unbuffered_cnt~0 1), 167#true, 110#P3EXITtrue, Black: 171#(<= ~__unbuffered_cnt~0 2), 179#true, 53#P2EXITtrue, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse]) [2021-03-26 10:13:23,456 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-03-26 10:13:23,456 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 10:13:23,456 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 10:13:23,456 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 10:13:23,472 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1149] L811-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#res.offset_7| 0) (= |v_P2Thread1of1ForFork2_#res.base_7| 0) (= v_~__unbuffered_cnt~0_103 (+ v_~__unbuffered_cnt~0_104 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_104} OutVars{P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset][81], [P1Thread1of1ForFork1InUse, 65#P0EXITtrue, P3Thread1of1ForFork3InUse, Black: 192#(and (= ~a$w_buff1~0 0) (<= 1 ~a$w_buff0_used~0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 194#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd3~0 0)), 9#P1EXITtrue, Black: 196#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~y~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd3~0 0)), Black: 182#(and (= ~a$w_buff1~0 0) (<= 1 ~a$w_buff0_used~0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 198#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~y~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 183#(and (= ~a$w_buff1~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd3~0 0)), Black: 188#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 137#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0))), 209#(= ~y~0 1), Black: 212#(and (= ~y~0 1) (= ~__unbuffered_p1_EAX~0 1)), Black: 148#(<= ~__unbuffered_cnt~0 0), Black: 151#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), 221#(and (= ~__unbuffered_p2_EAX~0 1) (= ~z~0 1)), Black: 218#(= ~z~0 1), 225#true, 101#L872true, Black: 159#(<= ~__unbuffered_cnt~0 1), 167#true, 110#P3EXITtrue, Black: 171#(<= ~__unbuffered_cnt~0 2), 179#true, 53#P2EXITtrue, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse]) [2021-03-26 10:13:23,472 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-03-26 10:13:23,472 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-26 10:13:23,472 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-26 10:13:23,472 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-03-26 10:13:23,505 INFO L129 PetriNetUnfolder]: 1695/3551 cut-off events. [2021-03-26 10:13:23,505 INFO L130 PetriNetUnfolder]: For 7445/8119 co-relation queries the response was YES. [2021-03-26 10:13:23,517 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14042 conditions, 3551 events. 1695/3551 cut-off events. For 7445/8119 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 30242 event pairs, 84 based on Foata normal form. 4/3291 useless extension candidates. Maximal degree in co-relation 14014. Up to 1342 conditions per place. [2021-03-26 10:13:23,548 INFO L142 LiptonReduction]: Number of co-enabled transitions 1540 [2021-03-26 10:13:24,856 INFO L154 LiptonReduction]: Checked pairs total: 162 [2021-03-26 10:13:24,857 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:13:24,857 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1595 [2021-03-26 10:13:24,857 INFO L480 AbstractCegarLoop]: Abstraction has has 76 places, 96 transitions, 730 flow [2021-03-26 10:13:24,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 179.83333333333334) internal successors, (1079), 6 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:24,858 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:13:24,858 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 10:13:24,858 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 10:13:24,858 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:13:24,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:13:24,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1135922382, now seen corresponding path program 1 times [2021-03-26 10:13:24,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:13:24,859 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991730325] [2021-03-26 10:13:24,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:13:24,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:13:24,921 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:24,922 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:13:24,924 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:24,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:13:24,928 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:24,928 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:13:24,932 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:24,933 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:13:24,938 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:24,938 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:13:24,945 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:24,945 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:13:24,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:13:24,946 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991730325] [2021-03-26 10:13:24,946 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:13:24,946 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 10:13:24,946 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812085818] [2021-03-26 10:13:24,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:13:24,946 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:13:24,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:13:24,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:13:24,948 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 209 [2021-03-26 10:13:24,949 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 96 transitions, 730 flow. Second operand has 7 states, 7 states have (on average 172.85714285714286) internal successors, (1210), 7 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:24,949 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:13:24,949 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 209 [2021-03-26 10:13:24,949 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:13:25,345 INFO L129 PetriNetUnfolder]: 1483/3271 cut-off events. [2021-03-26 10:13:25,346 INFO L130 PetriNetUnfolder]: For 9273/11786 co-relation queries the response was YES. [2021-03-26 10:13:25,360 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15036 conditions, 3271 events. 1483/3271 cut-off events. For 9273/11786 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 28648 event pairs, 68 based on Foata normal form. 891/3893 useless extension candidates. Maximal degree in co-relation 15006. Up to 1259 conditions per place. [2021-03-26 10:13:25,366 INFO L132 encePairwiseOnDemand]: 201/209 looper letters, 2 selfloop transitions, 18 changer transitions 22/100 dead transitions. [2021-03-26 10:13:25,366 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 100 transitions, 827 flow [2021-03-26 10:13:25,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 10:13:25,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 10:13:25,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1403 transitions. [2021-03-26 10:13:25,370 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8391148325358851 [2021-03-26 10:13:25,370 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1403 transitions. [2021-03-26 10:13:25,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1403 transitions. [2021-03-26 10:13:25,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:13:25,371 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1403 transitions. [2021-03-26 10:13:25,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 175.375) internal successors, (1403), 8 states have internal predecessors, (1403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:25,376 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 209.0) internal successors, (1881), 9 states have internal predecessors, (1881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:25,377 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 209.0) internal successors, (1881), 9 states have internal predecessors, (1881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:25,377 INFO L185 Difference]: Start difference. First operand has 76 places, 96 transitions, 730 flow. Second operand 8 states and 1403 transitions. [2021-03-26 10:13:25,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 100 transitions, 827 flow [2021-03-26 10:13:25,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 100 transitions, 760 flow, removed 16 selfloop flow, removed 5 redundant places. [2021-03-26 10:13:25,464 INFO L241 Difference]: Finished difference. Result has 81 places, 78 transitions, 578 flow [2021-03-26 10:13:25,464 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=578, PETRI_PLACES=81, PETRI_TRANSITIONS=78} [2021-03-26 10:13:25,464 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 23 predicate places. [2021-03-26 10:13:25,464 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:13:25,465 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 78 transitions, 578 flow [2021-03-26 10:13:25,465 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 78 transitions, 578 flow [2021-03-26 10:13:25,465 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 80 places, 78 transitions, 578 flow [2021-03-26 10:13:25,661 INFO L129 PetriNetUnfolder]: 1124/2625 cut-off events. [2021-03-26 10:13:25,661 INFO L130 PetriNetUnfolder]: For 5441/5945 co-relation queries the response was YES. [2021-03-26 10:13:25,672 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10378 conditions, 2625 events. 1124/2625 cut-off events. For 5441/5945 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 23212 event pairs, 54 based on Foata normal form. 4/2435 useless extension candidates. Maximal degree in co-relation 10348. Up to 989 conditions per place. [2021-03-26 10:13:25,688 INFO L142 LiptonReduction]: Number of co-enabled transitions 1160 [2021-03-26 10:13:26,101 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-26 10:13:26,234 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-26 10:13:26,869 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-26 10:13:27,004 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-26 10:13:27,224 INFO L154 LiptonReduction]: Checked pairs total: 904 [2021-03-26 10:13:27,224 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-26 10:13:27,224 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1760 [2021-03-26 10:13:27,224 INFO L480 AbstractCegarLoop]: Abstraction has has 77 places, 75 transitions, 570 flow [2021-03-26 10:13:27,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 172.85714285714286) internal successors, (1210), 7 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:27,225 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:13:27,225 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 10:13:27,225 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 10:13:27,225 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:13:27,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:13:27,225 INFO L82 PathProgramCache]: Analyzing trace with hash -292073307, now seen corresponding path program 1 times [2021-03-26 10:13:27,226 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:13:27,226 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062691313] [2021-03-26 10:13:27,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:13:27,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:13:27,286 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:27,287 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:13:27,294 INFO L142 QuantifierPusher]: treesize reduction 10, result has 79.2 percent of original size [2021-03-26 10:13:27,295 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-26 10:13:27,328 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:27,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 10:13:27,342 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:27,343 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 10:13:27,354 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:27,354 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:13:27,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:13:27,362 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062691313] [2021-03-26 10:13:27,362 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:13:27,362 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:13:27,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518320325] [2021-03-26 10:13:27,362 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:13:27,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:13:27,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:13:27,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:13:27,364 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 213 [2021-03-26 10:13:27,365 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 75 transitions, 570 flow. Second operand has 7 states, 7 states have (on average 150.28571428571428) internal successors, (1052), 7 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:27,365 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:13:27,365 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 213 [2021-03-26 10:13:27,365 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:13:28,055 INFO L129 PetriNetUnfolder]: 2618/5597 cut-off events. [2021-03-26 10:13:28,056 INFO L130 PetriNetUnfolder]: For 17088/19177 co-relation queries the response was YES. [2021-03-26 10:13:28,084 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22033 conditions, 5597 events. 2618/5597 cut-off events. For 17088/19177 co-relation queries the response was YES. Maximal size of possible extension queue 689. Compared 53769 event pairs, 107 based on Foata normal form. 237/5449 useless extension candidates. Maximal degree in co-relation 22001. Up to 1755 conditions per place. [2021-03-26 10:13:28,095 INFO L132 encePairwiseOnDemand]: 207/213 looper letters, 38 selfloop transitions, 16 changer transitions 2/106 dead transitions. [2021-03-26 10:13:28,095 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 106 transitions, 869 flow [2021-03-26 10:13:28,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:13:28,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:13:28,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1071 transitions. [2021-03-26 10:13:28,098 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7183098591549296 [2021-03-26 10:13:28,098 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1071 transitions. [2021-03-26 10:13:28,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1071 transitions. [2021-03-26 10:13:28,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:13:28,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1071 transitions. [2021-03-26 10:13:28,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 153.0) internal successors, (1071), 7 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:28,103 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 10:13:28,103 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 10:13:28,103 INFO L185 Difference]: Start difference. First operand has 77 places, 75 transitions, 570 flow. Second operand 7 states and 1071 transitions. [2021-03-26 10:13:28,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 106 transitions, 869 flow [2021-03-26 10:13:28,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 106 transitions, 777 flow, removed 23 selfloop flow, removed 10 redundant places. [2021-03-26 10:13:28,479 INFO L241 Difference]: Finished difference. Result has 77 places, 87 transitions, 646 flow [2021-03-26 10:13:28,479 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=646, PETRI_PLACES=77, PETRI_TRANSITIONS=87} [2021-03-26 10:13:28,479 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 19 predicate places. [2021-03-26 10:13:28,479 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:13:28,479 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 87 transitions, 646 flow [2021-03-26 10:13:28,480 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 87 transitions, 646 flow [2021-03-26 10:13:28,480 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 77 places, 87 transitions, 646 flow [2021-03-26 10:13:28,836 INFO L129 PetriNetUnfolder]: 2413/5074 cut-off events. [2021-03-26 10:13:28,837 INFO L130 PetriNetUnfolder]: For 7867/8454 co-relation queries the response was YES. [2021-03-26 10:13:28,856 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16333 conditions, 5074 events. 2413/5074 cut-off events. For 7867/8454 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 47690 event pairs, 95 based on Foata normal form. 134/4829 useless extension candidates. Maximal degree in co-relation 16304. Up to 1629 conditions per place. [2021-03-26 10:13:28,897 INFO L142 LiptonReduction]: Number of co-enabled transitions 1332 [2021-03-26 10:13:29,562 WARN L205 SmtUtils]: Spent 605.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-26 10:13:30,097 WARN L205 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 175 [2021-03-26 10:13:31,487 WARN L205 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 302 DAG size of output: 257 [2021-03-26 10:13:32,049 WARN L205 SmtUtils]: Spent 560.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2021-03-26 10:13:32,147 INFO L154 LiptonReduction]: Checked pairs total: 37 [2021-03-26 10:13:32,147 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:13:32,148 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3669 [2021-03-26 10:13:32,148 INFO L480 AbstractCegarLoop]: Abstraction has has 77 places, 87 transitions, 648 flow [2021-03-26 10:13:32,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 150.28571428571428) internal successors, (1052), 7 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:32,149 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:13:32,149 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:13:32,149 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 10:13:32,149 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:13:32,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:13:32,149 INFO L82 PathProgramCache]: Analyzing trace with hash -295642723, now seen corresponding path program 1 times [2021-03-26 10:13:32,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:13:32,150 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104161338] [2021-03-26 10:13:32,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:13:32,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:13:32,192 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:32,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:13:32,193 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:32,193 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:13:32,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:13:32,195 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104161338] [2021-03-26 10:13:32,195 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:13:32,195 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:13:32,196 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981903800] [2021-03-26 10:13:32,196 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:13:32,196 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:13:32,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:13:32,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:13:32,197 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 214 [2021-03-26 10:13:32,198 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 87 transitions, 648 flow. Second operand has 3 states, 3 states have (on average 186.33333333333334) internal successors, (559), 3 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:32,198 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:13:32,198 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 214 [2021-03-26 10:13:32,198 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:13:32,747 INFO L129 PetriNetUnfolder]: 2835/6036 cut-off events. [2021-03-26 10:13:32,748 INFO L130 PetriNetUnfolder]: For 10475/11463 co-relation queries the response was YES. [2021-03-26 10:13:32,769 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19587 conditions, 6036 events. 2835/6036 cut-off events. For 10475/11463 co-relation queries the response was YES. Maximal size of possible extension queue 808. Compared 59178 event pairs, 139 based on Foata normal form. 164/5718 useless extension candidates. Maximal degree in co-relation 19556. Up to 1938 conditions per place. [2021-03-26 10:13:32,775 INFO L132 encePairwiseOnDemand]: 211/214 looper letters, 3 selfloop transitions, 6 changer transitions 21/88 dead transitions. [2021-03-26 10:13:32,775 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 88 transitions, 661 flow [2021-03-26 10:13:32,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:13:32,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:13:32,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 561 transitions. [2021-03-26 10:13:32,777 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8738317757009346 [2021-03-26 10:13:32,777 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 561 transitions. [2021-03-26 10:13:32,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 561 transitions. [2021-03-26 10:13:32,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:13:32,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 561 transitions. [2021-03-26 10:13:32,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 187.0) internal successors, (561), 3 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:32,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:32,780 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:32,780 INFO L185 Difference]: Start difference. First operand has 77 places, 87 transitions, 648 flow. Second operand 3 states and 561 transitions. [2021-03-26 10:13:32,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 88 transitions, 661 flow [2021-03-26 10:13:33,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 88 transitions, 658 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:13:33,219 INFO L241 Difference]: Finished difference. Result has 79 places, 67 transitions, 478 flow [2021-03-26 10:13:33,219 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=478, PETRI_PLACES=79, PETRI_TRANSITIONS=67} [2021-03-26 10:13:33,219 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 21 predicate places. [2021-03-26 10:13:33,219 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:13:33,220 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 67 transitions, 478 flow [2021-03-26 10:13:33,220 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 67 transitions, 478 flow [2021-03-26 10:13:33,220 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 78 places, 67 transitions, 478 flow [2021-03-26 10:13:33,317 INFO L129 PetriNetUnfolder]: 696/1527 cut-off events. [2021-03-26 10:13:33,317 INFO L130 PetriNetUnfolder]: For 2495/2634 co-relation queries the response was YES. [2021-03-26 10:13:33,322 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4863 conditions, 1527 events. 696/1527 cut-off events. For 2495/2634 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 12051 event pairs, 37 based on Foata normal form. 17/1427 useless extension candidates. Maximal degree in co-relation 4833. Up to 496 conditions per place. [2021-03-26 10:13:33,335 INFO L142 LiptonReduction]: Number of co-enabled transitions 800 [2021-03-26 10:13:33,341 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 10:13:33,341 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:13:33,341 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 122 [2021-03-26 10:13:33,342 INFO L480 AbstractCegarLoop]: Abstraction has has 78 places, 67 transitions, 478 flow [2021-03-26 10:13:33,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 186.33333333333334) internal successors, (559), 3 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:33,342 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:13:33,342 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 10:13:33,342 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 10:13:33,342 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:13:33,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:13:33,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1168730954, now seen corresponding path program 1 times [2021-03-26 10:13:33,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:13:33,343 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342500926] [2021-03-26 10:13:33,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:13:33,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:13:33,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:33,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:13:33,449 INFO L142 QuantifierPusher]: treesize reduction 9, result has 76.9 percent of original size [2021-03-26 10:13:33,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 10:13:33,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:33,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-26 10:13:33,479 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:33,480 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 10:13:33,494 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:33,494 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:13:33,516 INFO L142 QuantifierPusher]: treesize reduction 59, result has 65.7 percent of original size [2021-03-26 10:13:33,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 113 [2021-03-26 10:13:33,562 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:33,562 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:13:33,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:13:33,571 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342500926] [2021-03-26 10:13:33,571 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:13:33,571 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-26 10:13:33,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951942763] [2021-03-26 10:13:33,571 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-26 10:13:33,571 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:13:33,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-26 10:13:33,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-03-26 10:13:33,573 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 214 [2021-03-26 10:13:33,575 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 67 transitions, 478 flow. Second operand has 9 states, 9 states have (on average 149.88888888888889) internal successors, (1349), 9 states have internal predecessors, (1349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:33,575 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:13:33,575 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 214 [2021-03-26 10:13:33,575 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:13:33,903 INFO L129 PetriNetUnfolder]: 1056/2276 cut-off events. [2021-03-26 10:13:33,903 INFO L130 PetriNetUnfolder]: For 4993/5505 co-relation queries the response was YES. [2021-03-26 10:13:33,911 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7802 conditions, 2276 events. 1056/2276 cut-off events. For 4993/5505 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 18795 event pairs, 120 based on Foata normal form. 105/2193 useless extension candidates. Maximal degree in co-relation 7770. Up to 670 conditions per place. [2021-03-26 10:13:33,914 INFO L132 encePairwiseOnDemand]: 209/214 looper letters, 9 selfloop transitions, 5 changer transitions 31/74 dead transitions. [2021-03-26 10:13:33,914 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 74 transitions, 584 flow [2021-03-26 10:13:33,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:13:33,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:13:33,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 912 transitions. [2021-03-26 10:13:33,926 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7102803738317757 [2021-03-26 10:13:33,926 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 912 transitions. [2021-03-26 10:13:33,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 912 transitions. [2021-03-26 10:13:33,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:13:33,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 912 transitions. [2021-03-26 10:13:33,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 152.0) internal successors, (912), 6 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:33,930 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 214.0) internal successors, (1498), 7 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:33,930 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 214.0) internal successors, (1498), 7 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:33,930 INFO L185 Difference]: Start difference. First operand has 78 places, 67 transitions, 478 flow. Second operand 6 states and 912 transitions. [2021-03-26 10:13:33,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 74 transitions, 584 flow [2021-03-26 10:13:34,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 74 transitions, 575 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:13:34,006 INFO L241 Difference]: Finished difference. Result has 82 places, 41 transitions, 262 flow [2021-03-26 10:13:34,006 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=262, PETRI_PLACES=82, PETRI_TRANSITIONS=41} [2021-03-26 10:13:34,006 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 24 predicate places. [2021-03-26 10:13:34,006 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:13:34,007 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 41 transitions, 262 flow [2021-03-26 10:13:34,007 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 41 transitions, 262 flow [2021-03-26 10:13:34,007 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 71 places, 41 transitions, 262 flow [2021-03-26 10:13:34,021 INFO L129 PetriNetUnfolder]: 53/149 cut-off events. [2021-03-26 10:13:34,021 INFO L130 PetriNetUnfolder]: For 686/713 co-relation queries the response was YES. [2021-03-26 10:13:34,022 INFO L84 FinitePrefix]: Finished finitePrefix Result has 499 conditions, 149 events. 53/149 cut-off events. For 686/713 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 604 event pairs, 1 based on Foata normal form. 9/149 useless extension candidates. Maximal degree in co-relation 469. Up to 48 conditions per place. [2021-03-26 10:13:34,023 INFO L142 LiptonReduction]: Number of co-enabled transitions 346 [2021-03-26 10:13:34,751 WARN L205 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-26 10:13:35,034 WARN L205 SmtUtils]: Spent 282.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-26 10:13:36,244 WARN L205 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-26 10:13:36,783 WARN L205 SmtUtils]: Spent 538.00 ms on a formula simplification that was a NOOP. DAG size: 255 [2021-03-26 10:13:37,039 INFO L154 LiptonReduction]: Checked pairs total: 131 [2021-03-26 10:13:37,040 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 10:13:37,040 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3034 [2021-03-26 10:13:37,040 INFO L480 AbstractCegarLoop]: Abstraction has has 69 places, 39 transitions, 260 flow [2021-03-26 10:13:37,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 149.88888888888889) internal successors, (1349), 9 states have internal predecessors, (1349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:37,041 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:13:37,041 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 10:13:37,041 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 10:13:37,041 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:13:37,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:13:37,041 INFO L82 PathProgramCache]: Analyzing trace with hash 562513612, now seen corresponding path program 2 times [2021-03-26 10:13:37,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:13:37,042 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600624323] [2021-03-26 10:13:37,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:13:37,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:13:37,097 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:13:37,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:13:37,152 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:13:37,191 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 10:13:37,192 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 10:13:37,192 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-26 10:13:37,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 10:13:37 BasicIcfg [2021-03-26 10:13:37,337 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 10:13:37,338 INFO L168 Benchmark]: Toolchain (without parser) took 36601.38 ms. Allocated memory was 255.9 MB in the beginning and 1.0 GB in the end (delta: 744.5 MB). Free memory was 235.6 MB in the beginning and 386.4 MB in the end (delta: -150.8 MB). Peak memory consumption was 592.3 MB. Max. memory is 16.0 GB. [2021-03-26 10:13:37,338 INFO L168 Benchmark]: CDTParser took 0.58 ms. Allocated memory is still 255.9 MB. Free memory is still 237.8 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 10:13:37,338 INFO L168 Benchmark]: CACSL2BoogieTranslator took 528.14 ms. Allocated memory was 255.9 MB in the beginning and 341.8 MB in the end (delta: 86.0 MB). Free memory was 235.6 MB in the beginning and 300.4 MB in the end (delta: -64.8 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.0 GB. [2021-03-26 10:13:37,338 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.13 ms. Allocated memory is still 341.8 MB. Free memory was 300.4 MB in the beginning and 297.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-26 10:13:37,339 INFO L168 Benchmark]: Boogie Preprocessor took 31.67 ms. Allocated memory is still 341.8 MB. Free memory was 297.5 MB in the beginning and 295.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:13:37,339 INFO L168 Benchmark]: RCFGBuilder took 2042.96 ms. Allocated memory is still 341.8 MB. Free memory was 295.0 MB in the beginning and 285.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 62.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:13:37,339 INFO L168 Benchmark]: TraceAbstraction took 33930.38 ms. Allocated memory was 341.8 MB in the beginning and 1.0 GB in the end (delta: 658.5 MB). Free memory was 284.0 MB in the beginning and 386.4 MB in the end (delta: -102.4 MB). Peak memory consumption was 556.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:13:37,340 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.58 ms. Allocated memory is still 255.9 MB. Free memory is still 237.8 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 528.14 ms. Allocated memory was 255.9 MB in the beginning and 341.8 MB in the end (delta: 86.0 MB). Free memory was 235.6 MB in the beginning and 300.4 MB in the end (delta: -64.8 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 64.13 ms. Allocated memory is still 341.8 MB. Free memory was 300.4 MB in the beginning and 297.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 31.67 ms. Allocated memory is still 341.8 MB. Free memory was 297.5 MB in the beginning and 295.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2042.96 ms. Allocated memory is still 341.8 MB. Free memory was 295.0 MB in the beginning and 285.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 62.1 MB. Max. memory is 16.0 GB. * TraceAbstraction took 33930.38 ms. Allocated memory was 341.8 MB in the beginning and 1.0 GB in the end (delta: 658.5 MB). Free memory was 284.0 MB in the beginning and 386.4 MB in the end (delta: -102.4 MB). Peak memory consumption was 556.1 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3553.7ms, 123 PlacesBefore, 58 PlacesAfterwards, 112 TransitionsBefore, 46 TransitionsAfterwards, 2672 CoEnabledTransitionPairs, 6 FixpointIterations, 31 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 74 TotalNumberOfCompositions, 5017 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2446, positive: 2329, positive conditional: 2329, positive unconditional: 0, negative: 117, negative conditional: 117, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2446, positive: 2329, positive conditional: 0, positive unconditional: 2329, negative: 117, negative conditional: 0, negative unconditional: 117, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2446, positive: 2329, positive conditional: 0, positive unconditional: 2329, negative: 117, negative conditional: 0, negative unconditional: 117, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1715, positive: 1675, positive conditional: 0, positive unconditional: 1675, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1715, positive: 1667, positive conditional: 0, positive unconditional: 1667, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 48, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 508, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 486, negative conditional: 0, negative unconditional: 486, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2446, positive: 654, positive conditional: 0, positive unconditional: 654, negative: 77, negative conditional: 0, negative unconditional: 77, unknown: 1715, unknown conditional: 0, unknown unconditional: 1715] , Statistics on independence cache: Total cache size (in pairs): 1715, Positive cache size: 1675, Positive conditional cache size: 0, Positive unconditional cache size: 1675, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1635.2ms, 54 PlacesBefore, 42 PlacesAfterwards, 43 TransitionsBefore, 31 TransitionsAfterwards, 608 CoEnabledTransitionPairs, 4 FixpointIterations, 7 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 2496 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 684, positive: 566, positive conditional: 566, positive unconditional: 0, negative: 118, negative conditional: 118, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 684, positive: 566, positive conditional: 36, positive unconditional: 530, negative: 118, negative conditional: 6, negative unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 684, positive: 566, positive conditional: 36, positive unconditional: 530, negative: 118, negative conditional: 6, negative unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 202, positive: 170, positive conditional: 11, positive unconditional: 159, negative: 32, negative conditional: 4, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 202, positive: 169, positive conditional: 0, positive unconditional: 169, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 33, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 32, negative conditional: 4, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 578, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 560, negative conditional: 95, negative unconditional: 465, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 684, positive: 396, positive conditional: 25, positive unconditional: 371, negative: 86, negative conditional: 2, negative unconditional: 84, unknown: 202, unknown conditional: 15, unknown unconditional: 187] , Statistics on independence cache: Total cache size (in pairs): 1917, Positive cache size: 1845, Positive conditional cache size: 11, Positive unconditional cache size: 1834, Negative cache size: 72, Negative conditional cache size: 4, Negative unconditional cache size: 68, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1209.5ms, 48 PlacesBefore, 42 PlacesAfterwards, 34 TransitionsBefore, 32 TransitionsAfterwards, 470 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 1152 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 296, positive: 242, positive conditional: 242, positive unconditional: 0, negative: 54, negative conditional: 54, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 296, positive: 242, positive conditional: 0, positive unconditional: 242, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 296, positive: 242, positive conditional: 0, positive unconditional: 242, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, positive: 16, positive conditional: 0, positive unconditional: 16, 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: 17, positive: 16, positive conditional: 0, positive unconditional: 16, 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: 16, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 296, positive: 226, positive conditional: 0, positive unconditional: 226, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 17, unknown conditional: 0, unknown unconditional: 17] , Statistics on independence cache: Total cache size (in pairs): 1934, Positive cache size: 1861, Positive conditional cache size: 11, Positive unconditional cache size: 1850, Negative cache size: 73, Negative conditional cache size: 4, Negative unconditional cache size: 69, Eliminated conditions: 63 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 453.0ms, 45 PlacesBefore, 45 PlacesAfterwards, 41 TransitionsBefore, 40 TransitionsAfterwards, 684 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 866 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 121, positive: 91, positive conditional: 91, positive unconditional: 0, negative: 30, negative conditional: 30, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 121, positive: 91, positive conditional: 27, positive unconditional: 64, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 121, positive: 91, positive conditional: 27, positive unconditional: 64, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, positive: 10, positive conditional: 7, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 42, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 121, positive: 81, positive conditional: 20, positive unconditional: 61, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 11, unknown conditional: 7, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 1945, Positive cache size: 1871, Positive conditional cache size: 18, Positive unconditional cache size: 1853, Negative cache size: 74, Negative conditional cache size: 4, Negative unconditional cache size: 70, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 172.4ms, 49 PlacesBefore, 49 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 790 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 894 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 127, positive: 99, positive conditional: 99, positive unconditional: 0, negative: 28, negative conditional: 28, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 127, positive: 99, positive conditional: 41, positive unconditional: 58, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 127, positive: 99, positive conditional: 41, positive unconditional: 58, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 9, 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: 10, positive: 10, positive conditional: 0, positive unconditional: 10, 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: 127, positive: 89, positive conditional: 32, positive unconditional: 57, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 10, unknown conditional: 9, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1955, Positive cache size: 1881, Positive conditional cache size: 27, Positive unconditional cache size: 1854, Negative cache size: 74, Negative conditional cache size: 4, Negative unconditional cache size: 70, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 75.5ms, 52 PlacesBefore, 52 PlacesAfterwards, 49 TransitionsBefore, 48 TransitionsAfterwards, 790 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1083 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 154, positive: 120, positive conditional: 120, 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: 154, positive: 120, positive conditional: 56, positive unconditional: 64, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 154, positive: 120, positive conditional: 56, positive unconditional: 64, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, positive: 17, positive conditional: 15, 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: 17, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 154, positive: 103, positive conditional: 41, positive unconditional: 62, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 17, unknown conditional: 15, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1972, Positive cache size: 1898, Positive conditional cache size: 42, Positive unconditional cache size: 1856, Negative cache size: 74, Negative conditional cache size: 4, Negative unconditional cache size: 70, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1341.7ms, 63 PlacesBefore, 63 PlacesAfterwards, 91 TransitionsBefore, 91 TransitionsAfterwards, 1494 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 1170 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 108, positive: 86, positive conditional: 86, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 108, positive: 86, positive conditional: 44, positive unconditional: 42, negative: 22, negative conditional: 10, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 108, positive: 86, positive conditional: 44, positive unconditional: 42, negative: 22, negative conditional: 10, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, positive: 16, positive conditional: 8, positive unconditional: 8, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 133, positive: 65, positive conditional: 65, positive unconditional: 0, negative: 68, negative conditional: 68, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 108, positive: 70, positive conditional: 36, positive unconditional: 34, negative: 20, negative conditional: 8, negative unconditional: 12, unknown: 18, unknown conditional: 10, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 1990, Positive cache size: 1914, Positive conditional cache size: 50, Positive unconditional cache size: 1864, Negative cache size: 76, Negative conditional cache size: 6, Negative unconditional cache size: 70, Eliminated conditions: 12 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1203.3ms, 68 PlacesBefore, 68 PlacesAfterwards, 93 TransitionsBefore, 92 TransitionsAfterwards, 1524 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 783 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 107, positive: 93, positive conditional: 93, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 107, positive: 93, positive conditional: 48, positive unconditional: 45, negative: 14, negative conditional: 4, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 107, positive: 93, positive conditional: 48, positive unconditional: 45, negative: 14, negative conditional: 4, negative unconditional: 10, 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: 107, positive: 86, positive conditional: 45, positive unconditional: 41, negative: 14, negative conditional: 4, negative unconditional: 10, unknown: 7, unknown conditional: 3, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 1997, Positive cache size: 1921, Positive conditional cache size: 53, Positive unconditional cache size: 1868, Negative cache size: 76, Negative conditional cache size: 6, Negative unconditional cache size: 70, Eliminated conditions: 21 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5325.9ms, 72 PlacesBefore, 72 PlacesAfterwards, 98 TransitionsBefore, 98 TransitionsAfterwards, 1550 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 274 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 80, positive: 76, positive conditional: 76, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 80, positive: 76, positive conditional: 40, positive unconditional: 36, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 80, positive: 76, positive conditional: 40, positive unconditional: 36, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 3, 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: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 80, positive: 71, positive conditional: 37, positive unconditional: 34, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 5, unknown conditional: 3, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 2002, Positive cache size: 1926, Positive conditional cache size: 56, Positive unconditional cache size: 1870, Negative cache size: 76, Negative conditional cache size: 6, Negative unconditional cache size: 70, Eliminated conditions: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1594.2ms, 76 PlacesBefore, 76 PlacesAfterwards, 96 TransitionsBefore, 96 TransitionsAfterwards, 1540 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 162 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, positive: 18, positive conditional: 18, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 21, positive: 18, positive conditional: 15, positive unconditional: 3, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 21, positive: 18, positive conditional: 15, positive unconditional: 3, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 4, 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: 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: 21, positive: 14, positive conditional: 11, positive unconditional: 3, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2006, Positive cache size: 1930, Positive conditional cache size: 60, Positive unconditional cache size: 1870, Negative cache size: 76, Negative conditional cache size: 6, Negative unconditional cache size: 70, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1759.1ms, 81 PlacesBefore, 77 PlacesAfterwards, 78 TransitionsBefore, 75 TransitionsAfterwards, 1160 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 904 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 149, positive: 127, positive conditional: 127, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 149, positive: 127, positive conditional: 72, positive unconditional: 55, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 149, positive: 127, positive conditional: 72, positive unconditional: 55, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 3, 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: 4, positive: 3, positive conditional: 0, positive unconditional: 3, 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: 149, positive: 124, positive conditional: 69, positive unconditional: 55, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 4, unknown conditional: 3, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 2010, Positive cache size: 1933, Positive conditional cache size: 63, Positive unconditional cache size: 1870, Negative cache size: 77, Negative conditional cache size: 6, Negative unconditional cache size: 71, Eliminated conditions: 55 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3667.9ms, 77 PlacesBefore, 77 PlacesAfterwards, 87 TransitionsBefore, 87 TransitionsAfterwards, 1332 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 37 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 37, positive: 37, positive conditional: 37, 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: 37, positive: 37, positive conditional: 22, 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: 37, positive: 37, positive conditional: 22, 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: 1, positive: 1, positive conditional: 1, 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: 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: 37, positive: 36, positive conditional: 21, positive unconditional: 15, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2011, Positive cache size: 1934, Positive conditional cache size: 64, Positive unconditional cache size: 1870, Negative cache size: 77, Negative conditional cache size: 6, Negative unconditional cache size: 71, Eliminated conditions: 8 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 121.3ms, 79 PlacesBefore, 78 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 800 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2011, Positive cache size: 1934, Positive conditional cache size: 64, Positive unconditional cache size: 1870, Negative cache size: 77, Negative conditional cache size: 6, Negative unconditional cache size: 71, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3032.7ms, 82 PlacesBefore, 69 PlacesAfterwards, 41 TransitionsBefore, 39 TransitionsAfterwards, 346 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 131 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 112, positive: 107, positive conditional: 107, 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: 112, positive: 107, positive conditional: 89, positive unconditional: 18, 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: 112, positive: 107, positive conditional: 89, positive unconditional: 18, 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: 35, positive: 34, positive conditional: 31, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 35, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 208, positive: 205, positive conditional: 205, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 112, positive: 73, positive conditional: 58, positive unconditional: 15, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 35, unknown conditional: 31, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 2046, Positive cache size: 1968, Positive conditional cache size: 95, Positive unconditional cache size: 1873, Negative cache size: 78, Negative conditional cache size: 6, Negative unconditional cache size: 72, Eliminated conditions: 2 - 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_p3_EAX = 0; [L718] 0 int a = 0; [L719] 0 _Bool a$flush_delayed; [L720] 0 int a$mem_tmp; [L721] 0 _Bool a$r_buff0_thd0; [L722] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd2; [L724] 0 _Bool a$r_buff0_thd3; [L725] 0 _Bool a$r_buff0_thd4; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$r_buff1_thd4; [L731] 0 _Bool a$read_delayed; [L732] 0 int *a$read_delayed_var; [L733] 0 int a$w_buff0; [L734] 0 _Bool a$w_buff0_used; [L735] 0 int a$w_buff1; [L736] 0 _Bool a$w_buff1_used; [L737] 0 _Bool main$tmp_guard0; [L738] 0 _Bool main$tmp_guard1; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L861] 0 pthread_t t1369; [L862] FCALL, FORK 0 pthread_create(&t1369, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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] [L750] 1 a$w_buff1 = a$w_buff0 [L751] 1 a$w_buff0 = 1 [L752] 1 a$w_buff1_used = a$w_buff0_used [L753] 1 a$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L755] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L756] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L757] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L758] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L759] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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] [L863] 0 pthread_t t1370; [L864] FCALL, FORK 0 pthread_create(&t1370, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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=0, y=0, z=0] [L763] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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] [L780] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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] [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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] [L865] 0 pthread_t t1371; [L866] FCALL, FORK 0 pthread_create(&t1371, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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] [L800] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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] [L803] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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] [L867] 0 pthread_t t1372; [L868] FCALL, FORK 0 pthread_create(&t1372, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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] [L820] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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] [L823] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L824] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L825] 4 a$flush_delayed = weak$$choice2 [L826] 4 a$mem_tmp = a [L827] 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) [L827] 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) [L828] 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)) [L828] 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) [L828] 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)) [L828] 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)) [L829] 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)) [L829] 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) [L829] 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)) [L829] 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)) [L830] 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)) [L830] 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) [L830] 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)) [L830] 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)) [L831] 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)) [L831] 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) [L831] 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)) [L831] 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)) [L832] 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)) [L832] 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) [L832] 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)) [L832] 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)) [L833] 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)) [L833] 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) [L833] 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)) [L833] 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)) [L834] 4 __unbuffered_p3_EAX = a [L835] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L835] 4 a = a$flush_delayed ? a$mem_tmp : a [L836] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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] [L839] 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) [L839] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L839] 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) [L839] 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) [L840] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L840] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L841] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L841] 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 [L842] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L842] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L843] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L843] 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 [L766] 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) [L766] 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) [L767] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L768] 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 [L769] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L770] 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 [L786] 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) [L786] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L786] 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) [L786] 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) [L787] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L787] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L788] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L788] 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 [L789] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L789] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L790] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L790] 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 [L806] 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) [L806] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L806] 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) [L806] 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) [L807] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L807] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L808] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L808] 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 [L809] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L809] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L810] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L810] 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 [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L846] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L848] 4 return 0; [L870] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L874] 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) [L874] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L874] 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) [L874] 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) [L875] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L875] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L876] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L876] 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 [L877] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L877] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L878] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L878] 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 [L881] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 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=0, __unbuffered_p3_EAX=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, 115 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.3ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 33658.6ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 6433.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 3634.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 78 SDtfs, 72 SDslu, 95 SDs, 0 SdLazy, 706 SolverSat, 132 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 701.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 625.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=730occurred in iteration=8, InterpolantAutomatonStates: 75, 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: 47.3ms SsaConstructionTime, 499.3ms SatisfiabilityAnalysisTime, 1135.5ms InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 256 ConstructedInterpolants, 0 QuantifiedInterpolants, 1933 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...