/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/mix010_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 09:53:33,013 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 09:53:33,015 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 09:53:33,046 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 09:53:33,046 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 09:53:33,048 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 09:53:33,050 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 09:53:33,055 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 09:53:33,056 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 09:53:33,059 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 09:53:33,060 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 09:53:33,061 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 09:53:33,061 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 09:53:33,063 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 09:53:33,064 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 09:53:33,066 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 09:53:33,068 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 09:53:33,069 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 09:53:33,071 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 09:53:33,075 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 09:53:33,076 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 09:53:33,077 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 09:53:33,077 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 09:53:33,079 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 09:53:33,083 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 09:53:33,084 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 09:53:33,084 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 09:53:33,085 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 09:53:33,085 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 09:53:33,086 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 09:53:33,086 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 09:53:33,087 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 09:53:33,088 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 09:53:33,088 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 09:53:33,089 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 09:53:33,089 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 09:53:33,089 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 09:53:33,089 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 09:53:33,089 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 09:53:33,090 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 09:53:33,090 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 09:53:33,091 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-03-26 09:53:33,118 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 09:53:33,119 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 09:53:33,121 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 09:53:33,121 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 09:53:33,122 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 09:53:33,122 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 09:53:33,122 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 09:53:33,122 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 09:53:33,122 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 09:53:33,122 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 09:53:33,123 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 09:53:33,123 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 09:53:33,123 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 09:53:33,123 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 09:53:33,123 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 09:53:33,123 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 09:53:33,123 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 09:53:33,123 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 09:53:33,124 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 09:53:33,124 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 09:53:33,124 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 09:53:33,124 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 09:53:33,124 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 09:53:33,124 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 09:53:33,124 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 09:53:33,124 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 09:53:33,124 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 09:53:33,124 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 09:53:33,125 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 09:53:33,125 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 09:53:33,125 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 09:53:33,431 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 09:53:33,446 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 09:53:33,449 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 09:53:33,449 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 09:53:33,450 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 09:53:33,451 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix010_pso.oepc.i [2021-03-26 09:53:33,495 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92a0dd5d0/d0c2b0404675442c99a634764b64cea4/FLAG7fadec40f [2021-03-26 09:53:33,944 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 09:53:33,944 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix010_pso.oepc.i [2021-03-26 09:53:33,957 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92a0dd5d0/d0c2b0404675442c99a634764b64cea4/FLAG7fadec40f [2021-03-26 09:53:34,269 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92a0dd5d0/d0c2b0404675442c99a634764b64cea4 [2021-03-26 09:53:34,270 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 09:53:34,271 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 09:53:34,272 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 09:53:34,272 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 09:53:34,274 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 09:53:34,275 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 09:53:34" (1/1) ... [2021-03-26 09:53:34,276 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f1e9a8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:53:34, skipping insertion in model container [2021-03-26 09:53:34,276 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 09:53:34" (1/1) ... [2021-03-26 09:53:34,280 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 09:53:34,310 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 09:53:34,397 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/mix010_pso.oepc.i[949,962] [2021-03-26 09:53:34,534 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 09:53:34,539 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 09:53:34,545 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/mix010_pso.oepc.i[949,962] [2021-03-26 09:53:34,572 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 09:53:34,608 INFO L208 MainTranslator]: Completed translation [2021-03-26 09:53:34,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:53:34 WrapperNode [2021-03-26 09:53:34,609 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 09:53:34,610 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 09:53:34,610 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 09:53:34,610 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 09:53:34,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:53:34" (1/1) ... [2021-03-26 09:53:34,625 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:53:34" (1/1) ... [2021-03-26 09:53:34,640 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 09:53:34,640 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 09:53:34,640 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 09:53:34,641 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 09:53:34,646 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:53:34" (1/1) ... [2021-03-26 09:53:34,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:53:34" (1/1) ... [2021-03-26 09:53:34,649 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:53:34" (1/1) ... [2021-03-26 09:53:34,649 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:53:34" (1/1) ... [2021-03-26 09:53:34,656 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:53:34" (1/1) ... [2021-03-26 09:53:34,658 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:53:34" (1/1) ... [2021-03-26 09:53:34,660 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:53:34" (1/1) ... [2021-03-26 09:53:34,663 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 09:53:34,663 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 09:53:34,663 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 09:53:34,663 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 09:53:34,664 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:53:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 09:53:34,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 09:53:34,729 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 09:53:34,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 09:53:34,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 09:53:34,730 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 09:53:34,730 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 09:53:34,730 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 09:53:34,730 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 09:53:34,730 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 09:53:34,730 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 09:53:34,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 09:53:34,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 09:53:34,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 09:53:34,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 09:53:34,731 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 09:53:36,048 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 09:53:36,048 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 09:53:36,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 09:53:36 BoogieIcfgContainer [2021-03-26 09:53:36,050 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 09:53:36,050 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 09:53:36,050 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 09:53:36,052 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 09:53:36,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 09:53:34" (1/3) ... [2021-03-26 09:53:36,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15736c25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 09:53:36, skipping insertion in model container [2021-03-26 09:53:36,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:53:34" (2/3) ... [2021-03-26 09:53:36,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15736c25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 09:53:36, skipping insertion in model container [2021-03-26 09:53:36,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 09:53:36" (3/3) ... [2021-03-26 09:53:36,054 INFO L111 eAbstractionObserver]: Analyzing ICFG mix010_pso.oepc.i [2021-03-26 09:53:36,057 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 09:53:36,060 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 09:53:36,060 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 09:53:36,083 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,083 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,083 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,083 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,083 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,083 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,083 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,083 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,083 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,084 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,084 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,084 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,084 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,084 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,084 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,084 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,084 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,084 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,084 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,084 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,085 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,085 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,085 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,085 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,085 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,085 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,085 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,085 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,085 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,085 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,086 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,086 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,086 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,086 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,086 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,086 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,086 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,086 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,086 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,086 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,087 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,087 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,087 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,087 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,087 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,087 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,087 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,087 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,087 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,087 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,088 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,088 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,088 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,088 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,088 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,088 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,088 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,088 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,088 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,088 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,088 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,089 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,089 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,089 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,089 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,089 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,089 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,089 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,089 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,089 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,089 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,089 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,089 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,089 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,089 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,092 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,092 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,093 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,093 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,093 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,093 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,093 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,093 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,093 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,093 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,093 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,093 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,093 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,093 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,094 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,094 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,094 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,094 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,094 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,094 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,094 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,094 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,094 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,094 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,094 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,094 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,094 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,094 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,094 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,094 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,094 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,098 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,098 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,098 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,098 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,099 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,099 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,099 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,099 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,100 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,100 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,100 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,100 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,100 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,100 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,100 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,100 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,101 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,101 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,101 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,101 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,103 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,104 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:53:36,106 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 09:53:36,117 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-26 09:53:36,129 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 09:53:36,129 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 09:53:36,129 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 09:53:36,129 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 09:53:36,129 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 09:53:36,129 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 09:53:36,129 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 09:53:36,130 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 09:53:36,136 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 225 flow [2021-03-26 09:53:36,160 INFO L129 PetriNetUnfolder]: 2/102 cut-off events. [2021-03-26 09:53:36,160 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 09:53:36,163 INFO L84 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 102 events. 2/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2021-03-26 09:53:36,163 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 105 transitions, 225 flow [2021-03-26 09:53:36,166 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 102 transitions, 213 flow [2021-03-26 09:53:36,167 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:53:36,175 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 102 transitions, 213 flow [2021-03-26 09:53:36,177 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 102 transitions, 213 flow [2021-03-26 09:53:36,178 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 110 places, 102 transitions, 213 flow [2021-03-26 09:53:36,190 INFO L129 PetriNetUnfolder]: 2/102 cut-off events. [2021-03-26 09:53:36,190 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 09:53:36,190 INFO L84 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 102 events. 2/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2021-03-26 09:53:36,192 INFO L142 LiptonReduction]: Number of co-enabled transitions 1966 [2021-03-26 09:53:37,177 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 09:53:37,531 WARN L205 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 09:53:37,644 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 09:53:38,630 INFO L154 LiptonReduction]: Checked pairs total: 3283 [2021-03-26 09:53:38,630 INFO L156 LiptonReduction]: Total number of compositions: 66 [2021-03-26 09:53:38,631 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2465 [2021-03-26 09:53:38,641 INFO L129 PetriNetUnfolder]: 0/15 cut-off events. [2021-03-26 09:53:38,641 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 09:53:38,641 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:53:38,642 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:53:38,642 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:53:38,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:53:38,648 INFO L82 PathProgramCache]: Analyzing trace with hash 367939881, now seen corresponding path program 1 times [2021-03-26 09:53:38,663 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:53:38,663 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060960026] [2021-03-26 09:53:38,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:53:38,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:53:38,905 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:53:38,906 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:53:38,907 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:53:38,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:53:38,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 09:53:38,912 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060960026] [2021-03-26 09:53:38,912 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:53:38,913 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 09:53:38,913 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500994984] [2021-03-26 09:53:38,918 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 09:53:38,918 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:53:38,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 09:53:38,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 09:53:38,927 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 171 [2021-03-26 09:53:38,931 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 99 flow. Second operand has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:53:38,931 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:53:38,931 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 171 [2021-03-26 09:53:38,932 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:53:38,996 INFO L129 PetriNetUnfolder]: 49/168 cut-off events. [2021-03-26 09:53:38,996 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 09:53:38,997 INFO L84 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 168 events. 49/168 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 747 event pairs, 38 based on Foata normal form. 17/175 useless extension candidates. Maximal degree in co-relation 241. Up to 65 conditions per place. [2021-03-26 09:53:38,999 INFO L132 encePairwiseOnDemand]: 167/171 looper letters, 9 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2021-03-26 09:53:38,999 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 46 transitions, 123 flow [2021-03-26 09:53:39,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 09:53:39,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 09:53:39,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 464 transitions. [2021-03-26 09:53:39,013 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9044834307992202 [2021-03-26 09:53:39,014 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 464 transitions. [2021-03-26 09:53:39,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 464 transitions. [2021-03-26 09:53:39,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:53:39,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 464 transitions. [2021-03-26 09:53:39,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:53:39,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:53:39,032 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:53:39,033 INFO L185 Difference]: Start difference. First operand has 54 places, 45 transitions, 99 flow. Second operand 3 states and 464 transitions. [2021-03-26 09:53:39,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 46 transitions, 123 flow [2021-03-26 09:53:39,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 46 transitions, 120 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-26 09:53:39,036 INFO L241 Difference]: Finished difference. Result has 51 places, 42 transitions, 94 flow [2021-03-26 09:53:39,037 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2021-03-26 09:53:39,038 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, -3 predicate places. [2021-03-26 09:53:39,038 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:53:39,038 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 94 flow [2021-03-26 09:53:39,039 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 42 transitions, 94 flow [2021-03-26 09:53:39,039 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 42 transitions, 94 flow [2021-03-26 09:53:39,044 INFO L129 PetriNetUnfolder]: 0/42 cut-off events. [2021-03-26 09:53:39,044 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 09:53:39,044 INFO L84 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 42 events. 0/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 55 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 09:53:39,045 INFO L142 LiptonReduction]: Number of co-enabled transitions 434 [2021-03-26 09:53:40,385 INFO L154 LiptonReduction]: Checked pairs total: 2398 [2021-03-26 09:53:40,385 INFO L156 LiptonReduction]: Total number of compositions: 15 [2021-03-26 09:53:40,385 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1347 [2021-03-26 09:53:40,386 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 64 flow [2021-03-26 09:53:40,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:53:40,387 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:53:40,387 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:53:40,387 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 09:53:40,387 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:53:40,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:53:40,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1677559145, now seen corresponding path program 1 times [2021-03-26 09:53:40,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:53:40,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584345584] [2021-03-26 09:53:40,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:53:40,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:53:40,488 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:53:40,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:53:40,489 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:53:40,489 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:53:40,494 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-26 09:53:40,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 09:53:40,503 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:53:40,503 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 09:53:40,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 09:53:40,509 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584345584] [2021-03-26 09:53:40,509 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:53:40,509 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 09:53:40,509 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795768825] [2021-03-26 09:53:40,509 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 09:53:40,510 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:53:40,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 09:53:40,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 09:53:40,511 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 186 [2021-03-26 09:53:40,511 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 64 flow. Second operand has 5 states, 5 states have (on average 151.0) internal successors, (755), 5 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:53:40,512 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:53:40,512 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 186 [2021-03-26 09:53:40,512 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:53:40,590 INFO L129 PetriNetUnfolder]: 77/198 cut-off events. [2021-03-26 09:53:40,590 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 09:53:40,591 INFO L84 FinitePrefix]: Finished finitePrefix Result has 347 conditions, 198 events. 77/198 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 943 event pairs, 20 based on Foata normal form. 0/180 useless extension candidates. Maximal degree in co-relation 335. Up to 59 conditions per place. [2021-03-26 09:53:40,591 INFO L132 encePairwiseOnDemand]: 178/186 looper letters, 9 selfloop transitions, 2 changer transitions 14/43 dead transitions. [2021-03-26 09:53:40,591 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 43 transitions, 146 flow [2021-03-26 09:53:40,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 09:53:40,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 09:53:40,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 926 transitions. [2021-03-26 09:53:40,593 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8297491039426523 [2021-03-26 09:53:40,593 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 926 transitions. [2021-03-26 09:53:40,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 926 transitions. [2021-03-26 09:53:40,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:53:40,594 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 926 transitions. [2021-03-26 09:53:40,596 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 154.33333333333334) internal successors, (926), 6 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:53:40,597 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 186.0) internal successors, (1302), 7 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:53:40,598 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 186.0) internal successors, (1302), 7 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:53:40,598 INFO L185 Difference]: Start difference. First operand has 36 places, 27 transitions, 64 flow. Second operand 6 states and 926 transitions. [2021-03-26 09:53:40,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 43 transitions, 146 flow [2021-03-26 09:53:40,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 43 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 09:53:40,599 INFO L241 Difference]: Finished difference. Result has 41 places, 26 transitions, 74 flow [2021-03-26 09:53:40,599 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=74, PETRI_PLACES=41, PETRI_TRANSITIONS=26} [2021-03-26 09:53:40,599 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, -13 predicate places. [2021-03-26 09:53:40,600 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:53:40,600 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 26 transitions, 74 flow [2021-03-26 09:53:40,600 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 26 transitions, 74 flow [2021-03-26 09:53:40,600 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 26 transitions, 74 flow [2021-03-26 09:53:40,604 INFO L129 PetriNetUnfolder]: 9/56 cut-off events. [2021-03-26 09:53:40,605 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 09:53:40,605 INFO L84 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 56 events. 9/56 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 161 event pairs, 9 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 79. Up to 21 conditions per place. [2021-03-26 09:53:40,605 INFO L142 LiptonReduction]: Number of co-enabled transitions 280 [2021-03-26 09:53:41,273 WARN L205 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-03-26 09:53:41,468 WARN L205 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-03-26 09:53:41,816 WARN L205 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-03-26 09:53:41,944 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-03-26 09:53:41,947 INFO L154 LiptonReduction]: Checked pairs total: 490 [2021-03-26 09:53:41,947 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 09:53:41,947 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1347 [2021-03-26 09:53:41,948 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 68 flow [2021-03-26 09:53:41,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 151.0) internal successors, (755), 5 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:53:41,948 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:53:41,948 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:53:41,948 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 09:53:41,949 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:53:41,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:53:41,949 INFO L82 PathProgramCache]: Analyzing trace with hash -2111709674, now seen corresponding path program 1 times [2021-03-26 09:53:41,949 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:53:41,949 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393343965] [2021-03-26 09:53:41,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:53:41,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:53:41,993 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:53:41,993 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:53:41,994 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:53:41,995 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:53:41,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 09:53:41,997 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393343965] [2021-03-26 09:53:41,997 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:53:41,997 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 09:53:41,997 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765148434] [2021-03-26 09:53:41,997 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 09:53:41,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:53:41,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 09:53:41,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 09:53:41,998 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 189 [2021-03-26 09:53:41,999 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:53:41,999 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:53:41,999 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 189 [2021-03-26 09:53:41,999 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:53:42,010 INFO L129 PetriNetUnfolder]: 9/53 cut-off events. [2021-03-26 09:53:42,010 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2021-03-26 09:53:42,011 INFO L84 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 53 events. 9/53 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 173 event pairs, 9 based on Foata normal form. 1/50 useless extension candidates. Maximal degree in co-relation 83. Up to 21 conditions per place. [2021-03-26 09:53:42,011 INFO L132 encePairwiseOnDemand]: 186/189 looper letters, 1 selfloop transitions, 2 changer transitions 0/23 dead transitions. [2021-03-26 09:53:42,011 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 23 transitions, 74 flow [2021-03-26 09:53:42,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 09:53:42,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 09:53:42,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 505 transitions. [2021-03-26 09:53:42,013 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.890652557319224 [2021-03-26 09:53:42,013 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 505 transitions. [2021-03-26 09:53:42,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 505 transitions. [2021-03-26 09:53:42,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:53:42,014 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 505 transitions. [2021-03-26 09:53:42,016 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:53:42,017 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:53:42,018 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:53:42,018 INFO L185 Difference]: Start difference. First operand has 34 places, 23 transitions, 68 flow. Second operand 3 states and 505 transitions. [2021-03-26 09:53:42,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 23 transitions, 74 flow [2021-03-26 09:53:42,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 23 transitions, 70 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 09:53:42,019 INFO L241 Difference]: Finished difference. Result has 35 places, 23 transitions, 72 flow [2021-03-26 09:53:42,019 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=35, PETRI_TRANSITIONS=23} [2021-03-26 09:53:42,019 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, -19 predicate places. [2021-03-26 09:53:42,019 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:53:42,019 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 23 transitions, 72 flow [2021-03-26 09:53:42,020 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 23 transitions, 72 flow [2021-03-26 09:53:42,020 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 23 transitions, 72 flow [2021-03-26 09:53:42,027 INFO L129 PetriNetUnfolder]: 9/53 cut-off events. [2021-03-26 09:53:42,027 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2021-03-26 09:53:42,029 INFO L84 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 53 events. 9/53 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 153 event pairs, 9 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 86. Up to 21 conditions per place. [2021-03-26 09:53:42,030 INFO L142 LiptonReduction]: Number of co-enabled transitions 248 [2021-03-26 09:53:42,034 INFO L154 LiptonReduction]: Checked pairs total: 150 [2021-03-26 09:53:42,034 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 09:53:42,034 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 15 [2021-03-26 09:53:42,037 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 23 transitions, 72 flow [2021-03-26 09:53:42,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:53:42,038 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:53:42,038 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:53:42,038 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 09:53:42,039 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:53:42,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:53:42,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1668670712, now seen corresponding path program 1 times [2021-03-26 09:53:42,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:53:42,040 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199085757] [2021-03-26 09:53:42,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:53:42,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:53:42,112 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:53:42,113 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:53:42,119 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 09:53:42,119 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 09:53:42,124 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:53:42,125 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:53:42,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 09:53:42,126 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199085757] [2021-03-26 09:53:42,126 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:53:42,126 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 09:53:42,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651323167] [2021-03-26 09:53:42,126 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 09:53:42,126 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:53:42,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 09:53:42,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 09:53:42,127 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 189 [2021-03-26 09:53:42,128 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 23 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 156.75) internal successors, (627), 4 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:53:42,128 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:53:42,128 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 189 [2021-03-26 09:53:42,128 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:53:42,188 INFO L129 PetriNetUnfolder]: 80/207 cut-off events. [2021-03-26 09:53:42,188 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2021-03-26 09:53:42,188 INFO L84 FinitePrefix]: Finished finitePrefix Result has 428 conditions, 207 events. 80/207 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1054 event pairs, 28 based on Foata normal form. 18/191 useless extension candidates. Maximal degree in co-relation 416. Up to 132 conditions per place. [2021-03-26 09:53:42,189 INFO L132 encePairwiseOnDemand]: 183/189 looper letters, 10 selfloop transitions, 8 changer transitions 0/34 dead transitions. [2021-03-26 09:53:42,189 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 34 transitions, 130 flow [2021-03-26 09:53:42,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 09:53:42,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 09:53:42,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 800 transitions. [2021-03-26 09:53:42,191 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8465608465608465 [2021-03-26 09:53:42,191 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 800 transitions. [2021-03-26 09:53:42,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 800 transitions. [2021-03-26 09:53:42,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:53:42,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 800 transitions. [2021-03-26 09:53:42,193 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 160.0) internal successors, (800), 5 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:53:42,194 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 189.0) internal successors, (1134), 6 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:53:42,195 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 189.0) internal successors, (1134), 6 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:53:42,195 INFO L185 Difference]: Start difference. First operand has 35 places, 23 transitions, 72 flow. Second operand 5 states and 800 transitions. [2021-03-26 09:53:42,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 34 transitions, 130 flow [2021-03-26 09:53:42,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 34 transitions, 126 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 09:53:42,196 INFO L241 Difference]: Finished difference. Result has 40 places, 30 transitions, 128 flow [2021-03-26 09:53:42,196 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=128, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2021-03-26 09:53:42,197 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, -14 predicate places. [2021-03-26 09:53:42,197 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:53:42,197 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 30 transitions, 128 flow [2021-03-26 09:53:42,197 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 30 transitions, 128 flow [2021-03-26 09:53:42,197 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 30 transitions, 128 flow [2021-03-26 09:53:42,208 INFO L129 PetriNetUnfolder]: 55/168 cut-off events. [2021-03-26 09:53:42,208 INFO L130 PetriNetUnfolder]: For 92/120 co-relation queries the response was YES. [2021-03-26 09:53:42,209 INFO L84 FinitePrefix]: Finished finitePrefix Result has 447 conditions, 168 events. 55/168 cut-off events. For 92/120 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 868 event pairs, 27 based on Foata normal form. 4/157 useless extension candidates. Maximal degree in co-relation 434. Up to 89 conditions per place. [2021-03-26 09:53:42,210 INFO L142 LiptonReduction]: Number of co-enabled transitions 344 [2021-03-26 09:53:42,215 INFO L154 LiptonReduction]: Checked pairs total: 304 [2021-03-26 09:53:42,215 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 09:53:42,215 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 18 [2021-03-26 09:53:42,216 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 122 flow [2021-03-26 09:53:42,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 156.75) internal successors, (627), 4 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:53:42,216 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:53:42,216 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:53:42,216 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 09:53:42,216 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:53:42,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:53:42,217 INFO L82 PathProgramCache]: Analyzing trace with hash 172596424, now seen corresponding path program 1 times [2021-03-26 09:53:42,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:53:42,217 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529372305] [2021-03-26 09:53:42,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:53:42,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:53:42,253 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:53:42,254 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:53:42,254 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:53:42,254 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:53:42,258 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-26 09:53:42,260 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 09:53:42,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 09:53:42,268 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529372305] [2021-03-26 09:53:42,268 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:53:42,268 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 09:53:42,268 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853588392] [2021-03-26 09:53:42,268 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 09:53:42,268 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:53:42,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 09:53:42,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 09:53:42,269 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 189 [2021-03-26 09:53:42,270 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 150.5) internal successors, (602), 4 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:53:42,270 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:53:42,270 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 189 [2021-03-26 09:53:42,270 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:53:42,320 INFO L129 PetriNetUnfolder]: 112/285 cut-off events. [2021-03-26 09:53:42,320 INFO L130 PetriNetUnfolder]: For 225/279 co-relation queries the response was YES. [2021-03-26 09:53:42,321 INFO L84 FinitePrefix]: Finished finitePrefix Result has 803 conditions, 285 events. 112/285 cut-off events. For 225/279 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1552 event pairs, 41 based on Foata normal form. 15/278 useless extension candidates. Maximal degree in co-relation 788. Up to 139 conditions per place. [2021-03-26 09:53:42,322 INFO L132 encePairwiseOnDemand]: 181/189 looper letters, 8 selfloop transitions, 10 changer transitions 0/36 dead transitions. [2021-03-26 09:53:42,322 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 36 transitions, 176 flow [2021-03-26 09:53:42,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 09:53:42,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 09:53:42,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 764 transitions. [2021-03-26 09:53:42,323 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8084656084656084 [2021-03-26 09:53:42,324 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 764 transitions. [2021-03-26 09:53:42,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 764 transitions. [2021-03-26 09:53:42,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:53:42,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 764 transitions. [2021-03-26 09:53:42,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 152.8) internal successors, (764), 5 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:53:42,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 189.0) internal successors, (1134), 6 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:53:42,327 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 189.0) internal successors, (1134), 6 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:53:42,327 INFO L185 Difference]: Start difference. First operand has 40 places, 29 transitions, 122 flow. Second operand 5 states and 764 transitions. [2021-03-26 09:53:42,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 36 transitions, 176 flow [2021-03-26 09:53:42,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 36 transitions, 170 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 09:53:42,364 INFO L241 Difference]: Finished difference. Result has 43 places, 34 transitions, 179 flow [2021-03-26 09:53:42,364 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=179, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2021-03-26 09:53:42,364 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, -11 predicate places. [2021-03-26 09:53:42,364 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:53:42,364 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 34 transitions, 179 flow [2021-03-26 09:53:42,365 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 34 transitions, 179 flow [2021-03-26 09:53:42,365 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 34 transitions, 179 flow [2021-03-26 09:53:42,393 INFO L129 PetriNetUnfolder]: 111/296 cut-off events. [2021-03-26 09:53:42,393 INFO L130 PetriNetUnfolder]: For 182/196 co-relation queries the response was YES. [2021-03-26 09:53:42,394 INFO L84 FinitePrefix]: Finished finitePrefix Result has 813 conditions, 296 events. 111/296 cut-off events. For 182/196 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1677 event pairs, 48 based on Foata normal form. 0/281 useless extension candidates. Maximal degree in co-relation 797. Up to 155 conditions per place. [2021-03-26 09:53:42,396 INFO L142 LiptonReduction]: Number of co-enabled transitions 362 [2021-03-26 09:53:42,406 INFO L154 LiptonReduction]: Checked pairs total: 124 [2021-03-26 09:53:42,406 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 09:53:42,406 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 42 [2021-03-26 09:53:42,408 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 179 flow [2021-03-26 09:53:42,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 150.5) internal successors, (602), 4 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:53:42,409 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:53:42,409 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:53:42,409 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 09:53:42,409 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:53:42,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:53:42,419 INFO L82 PathProgramCache]: Analyzing trace with hash -2118745740, now seen corresponding path program 2 times [2021-03-26 09:53:42,419 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:53:42,419 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719796728] [2021-03-26 09:53:42,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:53:42,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:53:42,492 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:53:42,492 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:53:42,494 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:53:42,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:53:42,498 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 09:53:42,499 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 09:53:42,504 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:53:42,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:53:42,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 09:53:42,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719796728] [2021-03-26 09:53:42,505 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:53:42,505 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 09:53:42,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52782719] [2021-03-26 09:53:42,505 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 09:53:42,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:53:42,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 09:53:42,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 09:53:42,506 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 189 [2021-03-26 09:53:42,507 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 179 flow. Second operand has 5 states, 5 states have (on average 156.8) internal successors, (784), 5 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:53:42,507 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:53:42,507 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 189 [2021-03-26 09:53:42,507 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:53:42,582 INFO L129 PetriNetUnfolder]: 109/281 cut-off events. [2021-03-26 09:53:42,582 INFO L130 PetriNetUnfolder]: For 257/424 co-relation queries the response was YES. [2021-03-26 09:53:42,584 INFO L84 FinitePrefix]: Finished finitePrefix Result has 928 conditions, 281 events. 109/281 cut-off events. For 257/424 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1491 event pairs, 8 based on Foata normal form. 52/306 useless extension candidates. Maximal degree in co-relation 910. Up to 157 conditions per place. [2021-03-26 09:53:42,585 INFO L132 encePairwiseOnDemand]: 183/189 looper letters, 8 selfloop transitions, 11 changer transitions 3/46 dead transitions. [2021-03-26 09:53:42,585 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 46 transitions, 285 flow [2021-03-26 09:53:42,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 09:53:42,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 09:53:42,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 960 transitions. [2021-03-26 09:53:42,587 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8465608465608465 [2021-03-26 09:53:42,587 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 960 transitions. [2021-03-26 09:53:42,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 960 transitions. [2021-03-26 09:53:42,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:53:42,588 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 960 transitions. [2021-03-26 09:53:42,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 160.0) internal successors, (960), 6 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:53:42,590 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 189.0) internal successors, (1323), 7 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:53:42,591 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 189.0) internal successors, (1323), 7 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:53:42,591 INFO L185 Difference]: Start difference. First operand has 43 places, 34 transitions, 179 flow. Second operand 6 states and 960 transitions. [2021-03-26 09:53:42,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 46 transitions, 285 flow [2021-03-26 09:53:42,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 46 transitions, 277 flow, removed 4 selfloop flow, removed 0 redundant places. [2021-03-26 09:53:42,596 INFO L241 Difference]: Finished difference. Result has 51 places, 41 transitions, 259 flow [2021-03-26 09:53:42,596 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=259, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2021-03-26 09:53:42,596 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, -3 predicate places. [2021-03-26 09:53:42,596 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:53:42,597 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 41 transitions, 259 flow [2021-03-26 09:53:42,597 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 41 transitions, 259 flow [2021-03-26 09:53:42,597 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 41 transitions, 259 flow [2021-03-26 09:53:42,625 INFO L129 PetriNetUnfolder]: 61/199 cut-off events. [2021-03-26 09:53:42,625 INFO L130 PetriNetUnfolder]: For 355/383 co-relation queries the response was YES. [2021-03-26 09:53:42,626 INFO L84 FinitePrefix]: Finished finitePrefix Result has 735 conditions, 199 events. 61/199 cut-off events. For 355/383 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1010 event pairs, 11 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 714. Up to 102 conditions per place. [2021-03-26 09:53:42,628 INFO L142 LiptonReduction]: Number of co-enabled transitions 444 [2021-03-26 09:53:42,665 INFO L154 LiptonReduction]: Checked pairs total: 578 [2021-03-26 09:53:42,665 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 09:53:42,665 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 69 [2021-03-26 09:53:42,669 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 251 flow [2021-03-26 09:53:42,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 156.8) internal successors, (784), 5 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:53:42,669 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:53:42,669 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:53:42,670 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 09:53:42,670 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:53:42,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:53:42,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1231680302, now seen corresponding path program 1 times [2021-03-26 09:53:42,670 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:53:42,671 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228185096] [2021-03-26 09:53:42,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:53:42,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:53:42,800 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:53:42,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:53:42,802 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:53:42,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:53:42,805 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:53:42,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:53:42,810 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 09:53:42,811 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 09:53:42,817 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:53:42,817 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:53:42,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 09:53:42,817 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228185096] [2021-03-26 09:53:42,817 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:53:42,817 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 09:53:42,818 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489449104] [2021-03-26 09:53:42,818 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 09:53:42,818 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:53:42,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 09:53:42,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 09:53:42,819 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 189 [2021-03-26 09:53:42,820 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 251 flow. Second operand has 6 states, 6 states have (on average 156.83333333333334) internal successors, (941), 6 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:53:42,820 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:53:42,820 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 189 [2021-03-26 09:53:42,820 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:53:42,896 INFO L129 PetriNetUnfolder]: 83/208 cut-off events. [2021-03-26 09:53:42,896 INFO L130 PetriNetUnfolder]: For 446/581 co-relation queries the response was YES. [2021-03-26 09:53:42,897 INFO L84 FinitePrefix]: Finished finitePrefix Result has 817 conditions, 208 events. 83/208 cut-off events. For 446/581 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 932 event pairs, 2 based on Foata normal form. 33/216 useless extension candidates. Maximal degree in co-relation 794. Up to 106 conditions per place. [2021-03-26 09:53:42,898 INFO L132 encePairwiseOnDemand]: 183/189 looper letters, 5 selfloop transitions, 11 changer transitions 4/44 dead transitions. [2021-03-26 09:53:42,898 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 44 transitions, 297 flow [2021-03-26 09:53:42,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 09:53:42,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 09:53:42,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1114 transitions. [2021-03-26 09:53:42,901 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8420256991685563 [2021-03-26 09:53:42,901 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1114 transitions. [2021-03-26 09:53:42,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1114 transitions. [2021-03-26 09:53:42,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:53:42,901 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1114 transitions. [2021-03-26 09:53:42,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 159.14285714285714) internal successors, (1114), 7 states have internal predecessors, (1114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:53:42,905 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 189.0) internal successors, (1512), 8 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:53:42,905 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 189.0) internal successors, (1512), 8 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:53:42,905 INFO L185 Difference]: Start difference. First operand has 51 places, 40 transitions, 251 flow. Second operand 7 states and 1114 transitions. [2021-03-26 09:53:42,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 44 transitions, 297 flow [2021-03-26 09:53:42,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 44 transitions, 266 flow, removed 10 selfloop flow, removed 5 redundant places. [2021-03-26 09:53:42,908 INFO L241 Difference]: Finished difference. Result has 53 places, 38 transitions, 232 flow [2021-03-26 09:53:42,909 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=232, PETRI_PLACES=53, PETRI_TRANSITIONS=38} [2021-03-26 09:53:42,909 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, -1 predicate places. [2021-03-26 09:53:42,909 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:53:42,909 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 38 transitions, 232 flow [2021-03-26 09:53:42,909 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 38 transitions, 232 flow [2021-03-26 09:53:42,909 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 38 transitions, 232 flow [2021-03-26 09:53:42,922 INFO L129 PetriNetUnfolder]: 35/126 cut-off events. [2021-03-26 09:53:42,923 INFO L130 PetriNetUnfolder]: For 182/185 co-relation queries the response was YES. [2021-03-26 09:53:42,923 INFO L84 FinitePrefix]: Finished finitePrefix Result has 442 conditions, 126 events. 35/126 cut-off events. For 182/185 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 499 event pairs, 6 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 421. Up to 36 conditions per place. [2021-03-26 09:53:42,924 INFO L142 LiptonReduction]: Number of co-enabled transitions 324 [2021-03-26 09:53:43,214 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2021-03-26 09:53:43,350 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2021-03-26 09:53:43,696 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2021-03-26 09:53:43,840 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2021-03-26 09:53:43,845 INFO L154 LiptonReduction]: Checked pairs total: 652 [2021-03-26 09:53:43,845 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-26 09:53:43,845 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 936 [2021-03-26 09:53:43,845 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 35 transitions, 220 flow [2021-03-26 09:53:43,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 156.83333333333334) internal successors, (941), 6 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:53:43,846 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:53:43,846 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:53:43,846 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 09:53:43,846 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:53:43,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:53:43,846 INFO L82 PathProgramCache]: Analyzing trace with hash 508820755, now seen corresponding path program 1 times [2021-03-26 09:53:43,846 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:53:43,846 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045299021] [2021-03-26 09:53:43,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:53:43,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:53:43,995 INFO L142 QuantifierPusher]: treesize reduction 31, result has 53.7 percent of original size [2021-03-26 09:53:43,997 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-26 09:53:44,016 INFO L142 QuantifierPusher]: treesize reduction 5, result has 95.2 percent of original size [2021-03-26 09:53:44,018 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 100 [2021-03-26 09:53:44,074 INFO L142 QuantifierPusher]: treesize reduction 11, result has 86.9 percent of original size [2021-03-26 09:53:44,076 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 73 [2021-03-26 09:53:44,125 INFO L142 QuantifierPusher]: treesize reduction 2, result has 96.9 percent of original size [2021-03-26 09:53:44,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 62 [2021-03-26 09:53:44,153 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:53:44,154 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:53:44,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 09:53:44,166 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045299021] [2021-03-26 09:53:44,166 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:53:44,166 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 09:53:44,166 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230987068] [2021-03-26 09:53:44,167 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 09:53:44,167 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:53:44,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 09:53:44,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-26 09:53:44,168 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 192 [2021-03-26 09:53:44,169 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 35 transitions, 220 flow. Second operand has 7 states, 7 states have (on average 140.14285714285714) internal successors, (981), 7 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:53:44,169 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:53:44,169 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 192 [2021-03-26 09:53:44,169 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:53:44,397 INFO L129 PetriNetUnfolder]: 122/332 cut-off events. [2021-03-26 09:53:44,397 INFO L130 PetriNetUnfolder]: For 1307/1369 co-relation queries the response was YES. [2021-03-26 09:53:44,398 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1167 conditions, 332 events. 122/332 cut-off events. For 1307/1369 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1938 event pairs, 9 based on Foata normal form. 36/359 useless extension candidates. Maximal degree in co-relation 1144. Up to 100 conditions per place. [2021-03-26 09:53:44,399 INFO L132 encePairwiseOnDemand]: 186/192 looper letters, 10 selfloop transitions, 5 changer transitions 5/47 dead transitions. [2021-03-26 09:53:44,399 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 47 transitions, 314 flow [2021-03-26 09:53:44,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 09:53:44,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 09:53:44,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 992 transitions. [2021-03-26 09:53:44,401 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7380952380952381 [2021-03-26 09:53:44,401 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 992 transitions. [2021-03-26 09:53:44,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 992 transitions. [2021-03-26 09:53:44,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:53:44,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 992 transitions. [2021-03-26 09:53:44,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 141.71428571428572) internal successors, (992), 7 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:53:44,406 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 192.0) internal successors, (1536), 8 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:53:44,406 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 192.0) internal successors, (1536), 8 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:53:44,406 INFO L185 Difference]: Start difference. First operand has 49 places, 35 transitions, 220 flow. Second operand 7 states and 992 transitions. [2021-03-26 09:53:44,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 47 transitions, 314 flow [2021-03-26 09:53:44,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 47 transitions, 262 flow, removed 17 selfloop flow, removed 7 redundant places. [2021-03-26 09:53:44,412 INFO L241 Difference]: Finished difference. Result has 51 places, 37 transitions, 213 flow [2021-03-26 09:53:44,412 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=213, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2021-03-26 09:53:44,412 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, -3 predicate places. [2021-03-26 09:53:44,412 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:53:44,412 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 37 transitions, 213 flow [2021-03-26 09:53:44,412 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 37 transitions, 213 flow [2021-03-26 09:53:44,413 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 37 transitions, 213 flow [2021-03-26 09:53:44,427 INFO L129 PetriNetUnfolder]: 60/192 cut-off events. [2021-03-26 09:53:44,427 INFO L130 PetriNetUnfolder]: For 364/383 co-relation queries the response was YES. [2021-03-26 09:53:44,428 INFO L84 FinitePrefix]: Finished finitePrefix Result has 581 conditions, 192 events. 60/192 cut-off events. For 364/383 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 998 event pairs, 7 based on Foata normal form. 12/196 useless extension candidates. Maximal degree in co-relation 561. Up to 51 conditions per place. [2021-03-26 09:53:44,429 INFO L142 LiptonReduction]: Number of co-enabled transitions 304 [2021-03-26 09:53:44,512 INFO L154 LiptonReduction]: Checked pairs total: 48 [2021-03-26 09:53:44,513 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 09:53:44,513 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 101 [2021-03-26 09:53:44,513 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 37 transitions, 213 flow [2021-03-26 09:53:44,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 140.14285714285714) internal successors, (981), 7 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:53:44,513 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:53:44,514 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:53:44,514 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 09:53:44,514 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:53:44,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:53:44,514 INFO L82 PathProgramCache]: Analyzing trace with hash 33330320, now seen corresponding path program 1 times [2021-03-26 09:53:44,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:53:44,514 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450463970] [2021-03-26 09:53:44,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:53:44,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:53:44,600 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:53:44,600 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:53:44,601 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:53:44,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:53:44,604 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:53:44,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:53:44,609 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-26 09:53:44,610 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 09:53:44,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 09:53:44,618 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450463970] [2021-03-26 09:53:44,618 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:53:44,618 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 09:53:44,618 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491885927] [2021-03-26 09:53:44,619 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 09:53:44,619 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:53:44,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 09:53:44,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 09:53:44,620 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 192 [2021-03-26 09:53:44,620 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 213 flow. Second operand has 5 states, 5 states have (on average 150.4) internal successors, (752), 5 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:53:44,620 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:53:44,620 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 192 [2021-03-26 09:53:44,620 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:53:44,680 INFO L129 PetriNetUnfolder]: 78/246 cut-off events. [2021-03-26 09:53:44,680 INFO L130 PetriNetUnfolder]: For 1083/1187 co-relation queries the response was YES. [2021-03-26 09:53:44,681 INFO L84 FinitePrefix]: Finished finitePrefix Result has 805 conditions, 246 events. 78/246 cut-off events. For 1083/1187 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1376 event pairs, 7 based on Foata normal form. 36/269 useless extension candidates. Maximal degree in co-relation 783. Up to 67 conditions per place. [2021-03-26 09:53:44,681 INFO L132 encePairwiseOnDemand]: 184/192 looper letters, 8 selfloop transitions, 4 changer transitions 12/44 dead transitions. [2021-03-26 09:53:44,681 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 44 transitions, 309 flow [2021-03-26 09:53:44,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 09:53:44,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 09:53:44,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 915 transitions. [2021-03-26 09:53:44,683 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7942708333333334 [2021-03-26 09:53:44,683 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 915 transitions. [2021-03-26 09:53:44,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 915 transitions. [2021-03-26 09:53:44,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:53:44,684 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 915 transitions. [2021-03-26 09:53:44,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 152.5) internal successors, (915), 6 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:53:44,687 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:53:44,687 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:53:44,687 INFO L185 Difference]: Start difference. First operand has 49 places, 37 transitions, 213 flow. Second operand 6 states and 915 transitions. [2021-03-26 09:53:44,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 44 transitions, 309 flow [2021-03-26 09:53:44,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 44 transitions, 296 flow, removed 3 selfloop flow, removed 5 redundant places. [2021-03-26 09:53:44,691 INFO L241 Difference]: Finished difference. Result has 50 places, 31 transitions, 174 flow [2021-03-26 09:53:44,691 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=174, PETRI_PLACES=50, PETRI_TRANSITIONS=31} [2021-03-26 09:53:44,691 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, -4 predicate places. [2021-03-26 09:53:44,691 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:53:44,691 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 31 transitions, 174 flow [2021-03-26 09:53:44,692 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 31 transitions, 174 flow [2021-03-26 09:53:44,692 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 31 transitions, 174 flow [2021-03-26 09:53:44,700 INFO L129 PetriNetUnfolder]: 27/106 cut-off events. [2021-03-26 09:53:44,701 INFO L130 PetriNetUnfolder]: For 268/304 co-relation queries the response was YES. [2021-03-26 09:53:44,701 INFO L84 FinitePrefix]: Finished finitePrefix Result has 317 conditions, 106 events. 27/106 cut-off events. For 268/304 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 436 event pairs, 8 based on Foata normal form. 8/107 useless extension candidates. Maximal degree in co-relation 298. Up to 25 conditions per place. [2021-03-26 09:53:44,702 INFO L142 LiptonReduction]: Number of co-enabled transitions 234 [2021-03-26 09:53:44,714 INFO L154 LiptonReduction]: Checked pairs total: 27 [2021-03-26 09:53:44,714 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 09:53:44,714 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 23 [2021-03-26 09:53:44,715 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 31 transitions, 174 flow [2021-03-26 09:53:44,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 150.4) internal successors, (752), 5 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 09:53:44,715 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:53:44,715 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:53:44,715 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 09:53:44,715 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:53:44,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:53:44,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1187048718, now seen corresponding path program 1 times [2021-03-26 09:53:44,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:53:44,716 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726006931] [2021-03-26 09:53:44,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:53:44,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 09:53:44,764 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 09:53:44,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 09:53:44,802 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 09:53:44,834 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 09:53:44,834 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 09:53:44,835 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 09:53:44,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 09:53:44 BasicIcfg [2021-03-26 09:53:44,909 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 09:53:44,910 INFO L168 Benchmark]: Toolchain (without parser) took 10638.29 ms. Allocated memory was 448.8 MB in the beginning and 803.2 MB in the end (delta: 354.4 MB). Free memory was 410.8 MB in the beginning and 672.4 MB in the end (delta: -261.7 MB). Peak memory consumption was 92.3 MB. Max. memory is 16.0 GB. [2021-03-26 09:53:44,910 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 448.8 MB. Free memory was 429.4 MB in the beginning and 429.3 MB in the end (delta: 71.0 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 09:53:44,910 INFO L168 Benchmark]: CACSL2BoogieTranslator took 336.81 ms. Allocated memory is still 448.8 MB. Free memory was 410.6 MB in the beginning and 407.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 5.1 MB. Max. memory is 16.0 GB. [2021-03-26 09:53:44,910 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.41 ms. Allocated memory is still 448.8 MB. Free memory was 406.8 MB in the beginning and 404.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 09:53:44,910 INFO L168 Benchmark]: Boogie Preprocessor took 22.44 ms. Allocated memory is still 448.8 MB. Free memory was 404.8 MB in the beginning and 402.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 09:53:44,910 INFO L168 Benchmark]: RCFGBuilder took 1386.25 ms. Allocated memory is still 448.8 MB. Free memory was 402.7 MB in the beginning and 359.4 MB in the end (delta: 43.3 MB). Peak memory consumption was 158.6 MB. Max. memory is 16.0 GB. [2021-03-26 09:53:44,911 INFO L168 Benchmark]: TraceAbstraction took 8858.80 ms. Allocated memory was 448.8 MB in the beginning and 803.2 MB in the end (delta: 354.4 MB). Free memory was 359.4 MB in the beginning and 672.4 MB in the end (delta: -313.1 MB). Peak memory consumption was 41.4 MB. Max. memory is 16.0 GB. [2021-03-26 09:53:44,912 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.46 ms. Allocated memory is still 448.8 MB. Free memory was 429.4 MB in the beginning and 429.3 MB in the end (delta: 71.0 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 336.81 ms. Allocated memory is still 448.8 MB. Free memory was 410.6 MB in the beginning and 407.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 5.1 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 30.41 ms. Allocated memory is still 448.8 MB. Free memory was 406.8 MB in the beginning and 404.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 22.44 ms. Allocated memory is still 448.8 MB. Free memory was 404.8 MB in the beginning and 402.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1386.25 ms. Allocated memory is still 448.8 MB. Free memory was 402.7 MB in the beginning and 359.4 MB in the end (delta: 43.3 MB). Peak memory consumption was 158.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 8858.80 ms. Allocated memory was 448.8 MB in the beginning and 803.2 MB in the end (delta: 354.4 MB). Free memory was 359.4 MB in the beginning and 672.4 MB in the end (delta: -313.1 MB). Peak memory consumption was 41.4 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2453.0ms, 110 PlacesBefore, 54 PlacesAfterwards, 102 TransitionsBefore, 45 TransitionsAfterwards, 1966 CoEnabledTransitionPairs, 4 FixpointIterations, 27 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 66 TotalNumberOfCompositions, 3283 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1763, positive: 1683, positive conditional: 1683, positive unconditional: 0, negative: 80, negative conditional: 80, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1763, positive: 1683, positive conditional: 0, positive unconditional: 1683, negative: 80, negative conditional: 0, negative unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1763, positive: 1683, positive conditional: 0, positive unconditional: 1683, negative: 80, negative conditional: 0, negative unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1327, positive: 1278, positive conditional: 0, positive unconditional: 1278, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1327, positive: 1272, positive conditional: 0, positive unconditional: 1272, negative: 55, negative conditional: 0, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 55, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 456, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 442, negative conditional: 0, negative unconditional: 442, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1763, positive: 405, positive conditional: 0, positive unconditional: 405, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 1327, unknown conditional: 0, unknown unconditional: 1327] , Statistics on independence cache: Total cache size (in pairs): 1327, Positive cache size: 1278, Positive conditional cache size: 0, Positive unconditional cache size: 1278, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1346.3ms, 51 PlacesBefore, 36 PlacesAfterwards, 42 TransitionsBefore, 27 TransitionsAfterwards, 434 CoEnabledTransitionPairs, 5 FixpointIterations, 11 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 15 TotalNumberOfCompositions, 2398 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 849, positive: 706, positive conditional: 706, positive unconditional: 0, negative: 143, negative conditional: 143, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 849, positive: 706, positive conditional: 82, positive unconditional: 624, negative: 143, negative conditional: 5, negative unconditional: 138, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 849, positive: 706, positive conditional: 82, positive unconditional: 624, negative: 143, negative conditional: 5, negative unconditional: 138, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 180, positive: 149, positive conditional: 13, positive unconditional: 136, negative: 31, negative conditional: 1, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 180, positive: 145, positive conditional: 0, positive unconditional: 145, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 35, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 31, negative conditional: 1, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 219, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 207, negative conditional: 16, negative unconditional: 191, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 849, positive: 557, positive conditional: 69, positive unconditional: 488, negative: 112, negative conditional: 4, negative unconditional: 108, unknown: 180, unknown conditional: 14, unknown unconditional: 166] , Statistics on independence cache: Total cache size (in pairs): 1507, Positive cache size: 1427, Positive conditional cache size: 13, Positive unconditional cache size: 1414, Negative cache size: 80, Negative conditional cache size: 1, Negative unconditional cache size: 79, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1347.0ms, 41 PlacesBefore, 34 PlacesAfterwards, 26 TransitionsBefore, 23 TransitionsAfterwards, 280 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 490 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 182, positive: 148, positive conditional: 148, 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: 182, positive: 148, positive conditional: 0, positive unconditional: 148, 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: 182, positive: 148, positive conditional: 0, positive unconditional: 148, 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: 19, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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.Query Time [ms]: [ total: 13, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 182, positive: 129, positive conditional: 0, positive unconditional: 129, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 19, unknown conditional: 0, unknown unconditional: 19] , Statistics on independence cache: Total cache size (in pairs): 1526, Positive cache size: 1446, Positive conditional cache size: 13, Positive unconditional cache size: 1433, Negative cache size: 80, Negative conditional cache size: 1, Negative unconditional cache size: 79, Eliminated conditions: 21 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 14.6ms, 35 PlacesBefore, 35 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 248 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 150 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 53, positive: 42, positive conditional: 42, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 53, positive: 42, positive conditional: 0, positive unconditional: 42, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 53, positive: 42, positive conditional: 0, positive unconditional: 42, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 53, positive: 40, positive conditional: 0, positive unconditional: 40, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1528, Positive cache size: 1448, Positive conditional cache size: 13, Positive unconditional cache size: 1435, Negative cache size: 80, Negative conditional cache size: 1, Negative unconditional cache size: 79, Eliminated conditions: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 17.7ms, 40 PlacesBefore, 40 PlacesAfterwards, 30 TransitionsBefore, 29 TransitionsAfterwards, 344 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 304 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 71, positive: 55, positive conditional: 55, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 71, positive: 55, positive conditional: 25, positive unconditional: 30, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 71, positive: 55, positive conditional: 25, positive unconditional: 30, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 9, 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: 11, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 71, positive: 44, positive conditional: 16, positive unconditional: 28, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 11, unknown conditional: 9, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1539, Positive cache size: 1459, Positive conditional cache size: 22, Positive unconditional cache size: 1437, Negative cache size: 80, Negative conditional cache size: 1, Negative unconditional cache size: 79, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 41.2ms, 43 PlacesBefore, 43 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 362 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 124 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, positive: 9, positive conditional: 9, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 15, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 1542, Positive cache size: 1462, Positive conditional cache size: 22, Positive unconditional cache size: 1440, Negative cache size: 80, Negative conditional cache size: 1, Negative unconditional cache size: 79, Eliminated conditions: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 67.9ms, 51 PlacesBefore, 51 PlacesAfterwards, 41 TransitionsBefore, 40 TransitionsAfterwards, 444 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 578 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 76, positive: 52, positive conditional: 52, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 76, positive: 52, positive conditional: 36, positive unconditional: 16, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 76, positive: 52, positive conditional: 36, positive unconditional: 16, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 24, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 76, positive: 46, positive conditional: 30, positive unconditional: 16, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 7, unknown conditional: 6, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1549, Positive cache size: 1468, Positive conditional cache size: 28, Positive unconditional cache size: 1440, Negative cache size: 81, Negative conditional cache size: 1, Negative unconditional cache size: 80, Eliminated conditions: 16 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 935.8ms, 53 PlacesBefore, 49 PlacesAfterwards, 38 TransitionsBefore, 35 TransitionsAfterwards, 324 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 652 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 125, positive: 91, positive conditional: 91, 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: 125, positive: 91, positive conditional: 62, positive unconditional: 29, 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: 125, positive: 91, positive conditional: 62, positive unconditional: 29, 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: 9, positive: 9, positive conditional: 8, 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: 9, positive: 9, positive conditional: 0, positive unconditional: 9, 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: 125, positive: 82, positive conditional: 54, positive unconditional: 28, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 9, unknown conditional: 8, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1558, Positive cache size: 1477, Positive conditional cache size: 36, Positive unconditional cache size: 1441, Negative cache size: 81, Negative conditional cache size: 1, Negative unconditional cache size: 80, Eliminated conditions: 29 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 100.2ms, 51 PlacesBefore, 49 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 304 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 48 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 4, positive conditional: 4, 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: 7, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 81, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 81, negative conditional: 31, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 3, unknown conditional: 1, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1561, Positive cache size: 1477, Positive conditional cache size: 36, Positive unconditional cache size: 1441, Negative cache size: 84, Negative conditional cache size: 2, Negative unconditional cache size: 82, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 22.7ms, 50 PlacesBefore, 47 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 234 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 27 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: 11, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1562, Positive cache size: 1477, Positive conditional cache size: 36, Positive unconditional cache size: 1441, Negative cache size: 85, Negative conditional cache size: 2, Negative unconditional cache size: 83, Eliminated conditions: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool a$flush_delayed; [L723] 0 int a$mem_tmp; [L724] 0 _Bool a$r_buff0_thd0; [L725] 0 _Bool a$r_buff0_thd1; [L726] 0 _Bool a$r_buff0_thd2; [L727] 0 _Bool a$r_buff0_thd3; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$read_delayed; [L733] 0 int *a$read_delayed_var; [L734] 0 int a$w_buff0; [L735] 0 _Bool a$w_buff0_used; [L736] 0 int a$w_buff1; [L737] 0 _Bool a$w_buff1_used; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L743] 0 int y = 0; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L850] 0 pthread_t t263; [L851] FCALL, FORK 0 pthread_create(&t263, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, 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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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] [L751] 1 a$w_buff1 = a$w_buff0 [L752] 1 a$w_buff0 = 1 [L753] 1 a$w_buff1_used = a$w_buff0_used [L754] 1 a$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L756] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L757] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L758] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L759] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, 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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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] [L763] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, 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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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] [L852] 0 pthread_t t264; [L853] FCALL, FORK 0 pthread_create(&t264, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, 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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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] [L780] 2 x = 1 [L783] 2 y = 1 [L786] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, 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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1, y=1, z=0] [L789] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, 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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1, y=1, z=0] [L854] 0 pthread_t t265; [L855] FCALL, FORK 0 pthread_create(&t265, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, 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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1, y=1, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, 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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1, y=1, z=1] [L809] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1, y=1, z=1] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 a$flush_delayed = weak$$choice2 [L815] 3 a$mem_tmp = a [L816] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L816] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L817] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L817] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0) [L817] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L817] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L818] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L818] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1) [L818] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L818] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L819] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L819] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used) [L819] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L819] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L820] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L820] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] EXPR 3 weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L821] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3) [L821] EXPR 3 weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L821] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L822] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L822] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 __unbuffered_p2_EBX = a [L824] EXPR 3 a$flush_delayed ? a$mem_tmp : a [L824] 3 a = a$flush_delayed ? a$mem_tmp : a [L825] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=49, weak$$choice2=0, x=1, y=1, z=1] [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 [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L792] 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) [L792] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L792] 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) [L792] 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) [L793] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L793] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L794] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L794] 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 [L795] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L795] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L796] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L796] 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 [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L828] 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) [L828] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L828] 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) [L828] 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) [L829] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L829] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L830] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L830] 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 [L831] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L831] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L832] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L832] 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 [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L837] 3 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L861] 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) [L861] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L861] 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) [L861] 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) [L862] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L862] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L863] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L863] 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 [L864] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L864] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L865] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L865] 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 [L868] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 104 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.5ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 8708.3ms, OverallIterations: 10, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 889.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2508.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 52 SDtfs, 53 SDslu, 37 SDs, 0 SdLazy, 211 SolverSat, 47 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 225.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 369.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=259occurred in iteration=6, InterpolantAutomatonStates: 48, 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: 38.7ms SsaConstructionTime, 414.6ms SatisfiabilityAnalysisTime, 688.8ms InterpolantComputationTime, 173 NumberOfCodeBlocks, 173 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 144 ConstructedInterpolants, 0 QuantifiedInterpolants, 1379 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...