/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix023_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 00:10:17,079 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 00:10:17,084 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 00:10:17,108 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 00:10:17,108 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 00:10:17,109 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 00:10:17,110 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 00:10:17,112 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 00:10:17,114 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 00:10:17,114 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 00:10:17,115 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 00:10:17,116 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 00:10:17,116 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 00:10:17,117 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 00:10:17,118 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 00:10:17,119 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 00:10:17,120 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 00:10:17,121 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 00:10:17,122 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 00:10:17,123 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 00:10:17,125 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 00:10:17,126 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 00:10:17,126 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 00:10:17,127 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 00:10:17,129 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 00:10:17,130 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 00:10:17,130 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 00:10:17,130 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 00:10:17,131 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 00:10:17,132 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 00:10:17,132 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 00:10:17,132 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 00:10:17,133 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 00:10:17,134 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 00:10:17,134 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 00:10:17,135 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 00:10:17,135 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 00:10:17,135 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 00:10:17,136 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 00:10:17,136 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 00:10:17,137 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 00:10:17,138 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-RepeatedSemanticLbeWithPredicates.epf [2021-03-26 00:10:17,158 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 00:10:17,158 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 00:10:17,159 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 00:10:17,160 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 00:10:17,160 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 00:10:17,160 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 00:10:17,160 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 00:10:17,160 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 00:10:17,161 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 00:10:17,161 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 00:10:17,161 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 00:10:17,161 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 00:10:17,161 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 00:10:17,162 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 00:10:17,162 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 00:10:17,162 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 00:10:17,162 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 00:10:17,162 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 00:10:17,163 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 00:10:17,163 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 00:10:17,163 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 00:10:17,163 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:10:17,163 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 00:10:17,164 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 00:10:17,164 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 00:10:17,164 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 00:10:17,164 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 00:10:17,164 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-26 00:10:17,164 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 00:10:17,165 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 00:10:17,165 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 00:10:17,456 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 00:10:17,482 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 00:10:17,484 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 00:10:17,485 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 00:10:17,486 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 00:10:17,487 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix023_tso.opt.i [2021-03-26 00:10:17,547 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c746f89a1/a105be2a92ca4f93b1057efc5fba22a0/FLAG478ee75e1 [2021-03-26 00:10:18,085 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 00:10:18,086 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_tso.opt.i [2021-03-26 00:10:18,101 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c746f89a1/a105be2a92ca4f93b1057efc5fba22a0/FLAG478ee75e1 [2021-03-26 00:10:18,517 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c746f89a1/a105be2a92ca4f93b1057efc5fba22a0 [2021-03-26 00:10:18,520 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 00:10:18,521 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 00:10:18,523 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 00:10:18,523 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 00:10:18,527 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 00:10:18,527 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:10:18" (1/1) ... [2021-03-26 00:10:18,529 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f44ec80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:10:18, skipping insertion in model container [2021-03-26 00:10:18,529 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:10:18" (1/1) ... [2021-03-26 00:10:18,535 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 00:10:18,575 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 00:10:18,719 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/mix023_tso.opt.i[948,961] [2021-03-26 00:10:18,943 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:10:18,951 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 00:10:18,968 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/mix023_tso.opt.i[948,961] [2021-03-26 00:10:19,048 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:10:19,143 INFO L208 MainTranslator]: Completed translation [2021-03-26 00:10:19,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:10:19 WrapperNode [2021-03-26 00:10:19,145 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 00:10:19,146 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 00:10:19,146 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 00:10:19,146 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 00:10:19,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:10:19" (1/1) ... [2021-03-26 00:10:19,188 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:10:19" (1/1) ... [2021-03-26 00:10:19,247 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 00:10:19,248 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 00:10:19,248 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 00:10:19,249 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 00:10:19,260 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:10:19" (1/1) ... [2021-03-26 00:10:19,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:10:19" (1/1) ... [2021-03-26 00:10:19,271 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:10:19" (1/1) ... [2021-03-26 00:10:19,271 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:10:19" (1/1) ... [2021-03-26 00:10:19,293 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:10:19" (1/1) ... [2021-03-26 00:10:19,312 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:10:19" (1/1) ... [2021-03-26 00:10:19,327 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:10:19" (1/1) ... [2021-03-26 00:10:19,333 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 00:10:19,334 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 00:10:19,334 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 00:10:19,334 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 00:10:19,335 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:10:19" (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 00:10:19,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 00:10:19,418 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 00:10:19,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 00:10:19,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 00:10:19,419 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 00:10:19,419 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 00:10:19,419 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 00:10:19,420 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 00:10:19,420 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 00:10:19,420 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 00:10:19,420 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-26 00:10:19,420 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-26 00:10:19,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 00:10:19,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 00:10:19,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 00:10:19,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 00:10:19,422 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 00:10:23,694 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 00:10:23,695 INFO L299 CfgBuilder]: Removed 12 assume(true) statements. [2021-03-26 00:10:23,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:10:23 BoogieIcfgContainer [2021-03-26 00:10:23,699 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 00:10:23,700 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 00:10:23,700 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 00:10:23,702 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 00:10:23,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 12:10:18" (1/3) ... [2021-03-26 00:10:23,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42a23dbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:10:23, skipping insertion in model container [2021-03-26 00:10:23,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:10:19" (2/3) ... [2021-03-26 00:10:23,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42a23dbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:10:23, skipping insertion in model container [2021-03-26 00:10:23,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:10:23" (3/3) ... [2021-03-26 00:10:23,706 INFO L111 eAbstractionObserver]: Analyzing ICFG mix023_tso.opt.i [2021-03-26 00:10:23,714 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 00:10:23,718 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2021-03-26 00:10:23,719 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 00:10:23,777 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,777 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,778 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,778 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,778 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,778 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,778 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,778 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,778 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,779 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,779 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,779 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,779 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,779 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,779 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,780 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,780 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,780 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,780 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,780 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,781 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,781 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,782 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,782 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,782 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,782 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,783 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,783 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,783 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,783 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,783 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,784 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,784 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,784 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,784 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,784 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,784 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,784 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,784 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,785 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,785 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,785 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,785 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,785 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,785 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,785 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,785 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,786 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,786 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,786 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,786 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,786 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,786 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,786 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,786 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,786 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,787 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,787 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,787 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,787 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,787 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,787 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,787 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,788 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,788 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,788 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,788 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,788 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,788 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,788 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,788 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,788 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,789 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,789 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,789 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,790 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,790 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,790 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,790 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,790 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,794 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,794 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,795 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,797 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,805 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,805 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,805 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,805 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,805 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,805 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,805 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,805 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,805 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,807 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,807 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,807 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,807 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,808 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,808 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,808 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,808 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,808 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,808 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,808 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,808 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,808 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,809 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,809 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,809 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,809 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,809 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,810 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,810 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,810 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,810 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,810 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,810 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,810 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,810 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,810 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,810 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,811 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,811 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,811 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,811 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,811 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,811 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,811 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,811 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,811 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,811 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,812 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,812 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,812 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,812 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,812 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,812 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,814 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,814 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,814 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,814 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,815 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,815 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,815 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,815 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,815 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,815 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,815 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,816 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,816 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,816 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,816 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,816 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,816 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,816 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,816 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,817 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,817 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,817 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,817 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,817 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,817 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,817 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,817 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,817 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,818 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,818 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,818 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,818 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,818 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,818 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,818 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,818 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,818 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,818 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,818 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,819 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,819 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,819 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,819 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,819 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,819 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,819 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,819 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,828 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,829 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,829 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,829 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,829 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,829 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,829 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,829 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,829 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,829 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,829 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,834 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,834 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,835 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,835 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,835 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,835 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,835 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,835 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,835 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,835 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,835 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,835 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,835 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,835 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,835 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,835 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,836 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,836 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,836 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,836 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,836 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,836 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,836 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,836 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,836 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,836 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,836 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,836 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,836 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,836 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,836 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,837 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,837 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,837 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,837 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,837 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,837 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,837 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,839 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,839 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite81| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,839 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite78| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,839 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite77| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,839 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,839 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,839 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite79| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,839 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite86| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,839 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite81| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,840 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,840 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite85| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,840 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite84| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,840 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite83| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,840 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite82| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,840 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,840 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite81| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,840 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite78| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,841 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite77| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,841 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,841 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,841 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite79| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,841 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite86| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,841 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite81| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,841 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,841 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite85| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,841 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite84| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,841 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite83| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,841 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite82| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,842 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,842 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,842 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,842 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,844 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,844 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,844 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,844 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,844 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,844 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,844 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,844 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,845 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,845 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,845 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,845 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,845 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,845 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,845 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,845 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,845 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,845 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,845 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,845 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,846 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,848 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,849 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,849 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,849 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,849 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,849 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,849 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,849 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,849 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,849 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,849 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,852 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,854 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,855 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,855 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,855 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,855 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,856 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,856 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,856 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite78| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,856 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,856 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,856 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite77| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,857 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,857 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,857 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,857 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite79| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,857 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,857 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,857 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,857 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,857 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,857 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,857 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,858 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,858 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite85| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,858 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,858 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite84| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,858 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,858 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,858 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,858 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite86| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,858 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,858 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,858 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,859 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,859 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,859 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite81| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,859 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,859 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,859 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite83| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,859 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,859 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite82| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,861 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,861 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,861 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,861 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,861 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,861 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,861 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,861 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,861 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:10:23,862 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 00:10:23,878 INFO L253 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2021-03-26 00:10:23,907 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 00:10:23,907 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 00:10:23,907 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 00:10:23,908 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 00:10:23,908 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 00:10:23,908 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 00:10:23,908 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 00:10:23,908 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 00:10:23,921 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 149 places, 138 transitions, 296 flow [2021-03-26 00:10:23,986 INFO L129 PetriNetUnfolder]: 2/134 cut-off events. [2021-03-26 00:10:23,986 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:10:23,999 INFO L84 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 134 events. 2/134 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 96 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2021-03-26 00:10:23,999 INFO L82 GeneralOperation]: Start removeDead. Operand has 149 places, 138 transitions, 296 flow [2021-03-26 00:10:24,003 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 145 places, 134 transitions, 280 flow [2021-03-26 00:10:24,004 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:10:24,015 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 134 transitions, 280 flow [2021-03-26 00:10:24,017 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 134 transitions, 280 flow [2021-03-26 00:10:24,019 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 145 places, 134 transitions, 280 flow [2021-03-26 00:10:24,048 INFO L129 PetriNetUnfolder]: 2/134 cut-off events. [2021-03-26 00:10:24,048 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:10:24,049 INFO L84 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 134 events. 2/134 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 101 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2021-03-26 00:10:24,052 INFO L142 LiptonReduction]: Number of co-enabled transitions 2988 [2021-03-26 00:10:28,141 WARN L205 SmtUtils]: Spent 2.63 s on a formula simplification. DAG size of input: 432 DAG size of output: 351 [2021-03-26 00:10:28,940 WARN L205 SmtUtils]: Spent 795.00 ms on a formula simplification that was a NOOP. DAG size: 347 [2021-03-26 00:10:33,253 WARN L205 SmtUtils]: Spent 4.31 s on a formula simplification. DAG size of input: 600 DAG size of output: 511 [2021-03-26 00:10:35,212 WARN L205 SmtUtils]: Spent 1.95 s on a formula simplification that was a NOOP. DAG size: 506 [2021-03-26 00:10:36,313 WARN L205 SmtUtils]: Spent 589.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 110 [2021-03-26 00:10:36,499 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-26 00:10:37,543 WARN L205 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 208 DAG size of output: 158 [2021-03-26 00:10:37,926 WARN L205 SmtUtils]: Spent 377.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2021-03-26 00:10:41,002 WARN L205 SmtUtils]: Spent 949.00 ms on a formula simplification that was a NOOP. DAG size: 349 [2021-03-26 00:10:41,901 WARN L205 SmtUtils]: Spent 896.00 ms on a formula simplification that was a NOOP. DAG size: 349 [2021-03-26 00:10:43,984 WARN L205 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 508 [2021-03-26 00:10:46,177 WARN L205 SmtUtils]: Spent 2.19 s on a formula simplification that was a NOOP. DAG size: 508 [2021-03-26 00:10:46,374 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2021-03-26 00:10:46,542 INFO L154 LiptonReduction]: Checked pairs total: 6284 [2021-03-26 00:10:46,542 INFO L156 LiptonReduction]: Total number of compositions: 86 [2021-03-26 00:10:46,546 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 22543 [2021-03-26 00:10:46,557 INFO L129 PetriNetUnfolder]: 0/27 cut-off events. [2021-03-26 00:10:46,558 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:10:46,558 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:10:46,558 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 00:10:46,559 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:10:46,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:10:46,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1018126350, now seen corresponding path program 1 times [2021-03-26 00:10:46,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:10:46,577 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650521983] [2021-03-26 00:10:46,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:10:46,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:10:46,815 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:10:46,817 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:10:46,818 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:10:46,819 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:10:46,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:10:46,828 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650521983] [2021-03-26 00:10:46,828 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:10:46,828 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:10:46,829 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199226145] [2021-03-26 00:10:46,836 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:10:46,836 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:10:46,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:10:46,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:10:46,852 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 224 [2021-03-26 00:10:46,858 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 58 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 0 states have call successors, (0), 0 states 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 00:10:46,858 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:10:46,859 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 224 [2021-03-26 00:10:46,860 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:10:47,153 INFO L129 PetriNetUnfolder]: 257/622 cut-off events. [2021-03-26 00:10:47,154 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:10:47,158 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1021 conditions, 622 events. 257/622 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3848 event pairs, 179 based on Foata normal form. 27/594 useless extension candidates. Maximal degree in co-relation 992. Up to 313 conditions per place. [2021-03-26 00:10:47,164 INFO L132 encePairwiseOnDemand]: 220/224 looper letters, 14 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2021-03-26 00:10:47,164 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 61 transitions, 166 flow [2021-03-26 00:10:47,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:10:47,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:10:47,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 622 transitions. [2021-03-26 00:10:47,185 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9255952380952381 [2021-03-26 00:10:47,186 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 622 transitions. [2021-03-26 00:10:47,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 622 transitions. [2021-03-26 00:10:47,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:10:47,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 622 transitions. [2021-03-26 00:10:47,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 0 states have call successors, (0), 0 states 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 00:10:47,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 0 states have call successors, (0), 0 states 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 00:10:47,218 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 0 states have call successors, (0), 0 states 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 00:10:47,220 INFO L185 Difference]: Start difference. First operand has 70 places, 58 transitions, 128 flow. Second operand 3 states and 622 transitions. [2021-03-26 00:10:47,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 61 transitions, 166 flow [2021-03-26 00:10:47,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 61 transitions, 162 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-26 00:10:47,229 INFO L241 Difference]: Finished difference. Result has 66 places, 55 transitions, 122 flow [2021-03-26 00:10:47,231 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2021-03-26 00:10:47,232 INFO L343 CegarLoopForPetriNet]: 70 programPoint places, -4 predicate places. [2021-03-26 00:10:47,232 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:10:47,232 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 55 transitions, 122 flow [2021-03-26 00:10:47,233 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 55 transitions, 122 flow [2021-03-26 00:10:47,234 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 55 transitions, 122 flow [2021-03-26 00:10:47,245 INFO L129 PetriNetUnfolder]: 0/55 cut-off events. [2021-03-26 00:10:47,245 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:10:47,246 INFO L84 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 55 events. 0/55 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 68 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 00:10:47,246 INFO L142 LiptonReduction]: Number of co-enabled transitions 752 [2021-03-26 00:10:49,751 WARN L205 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 358 DAG size of output: 357 [2021-03-26 00:10:50,713 WARN L205 SmtUtils]: Spent 960.00 ms on a formula simplification that was a NOOP. DAG size: 357 [2021-03-26 00:10:55,384 WARN L205 SmtUtils]: Spent 4.67 s on a formula simplification. DAG size of input: 523 DAG size of output: 520 [2021-03-26 00:10:58,030 WARN L205 SmtUtils]: Spent 2.64 s on a formula simplification that was a NOOP. DAG size: 519 [2021-03-26 00:10:59,344 WARN L205 SmtUtils]: Spent 1.24 s on a formula simplification that was a NOOP. DAG size: 350 [2021-03-26 00:11:00,649 WARN L205 SmtUtils]: Spent 1.30 s on a formula simplification that was a NOOP. DAG size: 350 [2021-03-26 00:11:06,301 WARN L205 SmtUtils]: Spent 5.65 s on a formula simplification. DAG size of input: 509 DAG size of output: 508 [2021-03-26 00:11:09,365 WARN L205 SmtUtils]: Spent 3.05 s on a formula simplification that was a NOOP. DAG size: 508 [2021-03-26 00:11:12,430 WARN L205 SmtUtils]: Spent 2.20 s on a formula simplification that was a NOOP. DAG size: 363 [2021-03-26 00:11:13,961 WARN L205 SmtUtils]: Spent 1.53 s on a formula simplification that was a NOOP. DAG size: 361 [2021-03-26 00:11:19,434 WARN L205 SmtUtils]: Spent 5.47 s on a formula simplification that was a NOOP. DAG size: 525 [2021-03-26 00:11:23,026 WARN L205 SmtUtils]: Spent 3.59 s on a formula simplification that was a NOOP. DAG size: 523 [2021-03-26 00:11:23,333 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-03-26 00:11:23,460 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-03-26 00:11:23,583 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-03-26 00:11:23,703 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-03-26 00:11:24,009 WARN L205 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 00:11:24,206 WARN L205 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 00:11:24,396 WARN L205 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 00:11:24,605 WARN L205 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 00:11:24,618 INFO L154 LiptonReduction]: Checked pairs total: 3191 [2021-03-26 00:11:24,618 INFO L156 LiptonReduction]: Total number of compositions: 18 [2021-03-26 00:11:24,618 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 37386 [2021-03-26 00:11:24,620 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 86 flow [2021-03-26 00:11:24,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 0 states have call successors, (0), 0 states 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 00:11:24,621 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:11:24,621 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:11:24,621 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 00:11:24,621 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:11:24,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:11:24,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1906941473, now seen corresponding path program 1 times [2021-03-26 00:11:24,622 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:11:24,622 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382884953] [2021-03-26 00:11:24,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:11:24,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:11:24,704 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:24,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:11:24,707 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:24,708 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:11:24,714 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 00:11:24,714 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382884953] [2021-03-26 00:11:24,714 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:11:24,715 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:11:24,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177230991] [2021-03-26 00:11:24,716 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:11:24,716 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:11:24,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:11:24,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:11:24,719 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 242 [2021-03-26 00:11:24,720 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 0 states 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 00:11:24,720 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:11:24,720 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 242 [2021-03-26 00:11:24,720 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:11:24,855 INFO L129 PetriNetUnfolder]: 33/109 cut-off events. [2021-03-26 00:11:24,855 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:11:24,856 INFO L84 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 109 events. 33/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 410 event pairs, 3 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 175. Up to 55 conditions per place. [2021-03-26 00:11:24,857 INFO L132 encePairwiseOnDemand]: 239/242 looper letters, 8 selfloop transitions, 2 changer transitions 3/40 dead transitions. [2021-03-26 00:11:24,857 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 40 transitions, 116 flow [2021-03-26 00:11:24,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:11:24,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:11:24,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 658 transitions. [2021-03-26 00:11:24,862 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.90633608815427 [2021-03-26 00:11:24,862 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 658 transitions. [2021-03-26 00:11:24,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 658 transitions. [2021-03-26 00:11:24,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:11:24,863 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 658 transitions. [2021-03-26 00:11:24,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 0 states have call successors, (0), 0 states 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 00:11:24,866 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states 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 00:11:24,867 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states 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 00:11:24,867 INFO L185 Difference]: Start difference. First operand has 48 places, 37 transitions, 86 flow. Second operand 3 states and 658 transitions. [2021-03-26 00:11:24,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 40 transitions, 116 flow [2021-03-26 00:11:24,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 40 transitions, 112 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:11:24,868 INFO L241 Difference]: Finished difference. Result has 47 places, 34 transitions, 80 flow [2021-03-26 00:11:24,869 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2021-03-26 00:11:24,870 INFO L343 CegarLoopForPetriNet]: 70 programPoint places, -23 predicate places. [2021-03-26 00:11:24,870 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:11:24,871 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 34 transitions, 80 flow [2021-03-26 00:11:24,871 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 34 transitions, 80 flow [2021-03-26 00:11:24,871 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 34 transitions, 80 flow [2021-03-26 00:11:24,876 INFO L129 PetriNetUnfolder]: 0/34 cut-off events. [2021-03-26 00:11:24,877 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:11:24,877 INFO L84 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 34 events. 0/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 54 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 00:11:24,877 INFO L142 LiptonReduction]: Number of co-enabled transitions 490 [2021-03-26 00:11:25,193 WARN L205 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-26 00:11:25,463 WARN L205 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-26 00:11:25,707 WARN L205 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-26 00:11:25,952 WARN L205 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-26 00:11:26,330 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2021-03-26 00:11:26,439 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2021-03-26 00:11:26,546 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2021-03-26 00:11:26,654 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2021-03-26 00:11:26,659 INFO L154 LiptonReduction]: Checked pairs total: 1920 [2021-03-26 00:11:26,659 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 00:11:26,659 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1789 [2021-03-26 00:11:26,660 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 74 flow [2021-03-26 00:11:26,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 0 states 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 00:11:26,661 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:11:26,661 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:11:26,661 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 00:11:26,661 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:11:26,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:11:26,662 INFO L82 PathProgramCache]: Analyzing trace with hash 881615090, now seen corresponding path program 1 times [2021-03-26 00:11:26,662 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:11:26,662 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594949096] [2021-03-26 00:11:26,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:11:26,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:11:26,823 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:26,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:11:26,830 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 00:11:26,830 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594949096] [2021-03-26 00:11:26,831 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:11:26,831 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 00:11:26,831 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948664984] [2021-03-26 00:11:26,832 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:11:26,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:11:26,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:11:26,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:11:26,834 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 245 [2021-03-26 00:11:26,834 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 223.66666666666666) internal successors, (671), 3 states have internal predecessors, (671), 0 states have call successors, (0), 0 states 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 00:11:26,834 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:11:26,835 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 245 [2021-03-26 00:11:26,835 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:11:26,861 INFO L129 PetriNetUnfolder]: 0/31 cut-off events. [2021-03-26 00:11:26,861 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:11:26,861 INFO L84 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 31 events. 0/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 56 event pairs, 0 based on Foata normal form. 1/31 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 00:11:26,862 INFO L132 encePairwiseOnDemand]: 242/245 looper letters, 1 selfloop transitions, 2 changer transitions 1/31 dead transitions. [2021-03-26 00:11:26,862 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 31 transitions, 80 flow [2021-03-26 00:11:26,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:11:26,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:11:26,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 673 transitions. [2021-03-26 00:11:26,867 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9156462585034013 [2021-03-26 00:11:26,867 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 673 transitions. [2021-03-26 00:11:26,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 673 transitions. [2021-03-26 00:11:26,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:11:26,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 673 transitions. [2021-03-26 00:11:26,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states 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 00:11:26,870 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:11:26,871 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:11:26,871 INFO L185 Difference]: Start difference. First operand has 42 places, 31 transitions, 74 flow. Second operand 3 states and 673 transitions. [2021-03-26 00:11:26,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 31 transitions, 80 flow [2021-03-26 00:11:26,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 31 transitions, 76 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:11:26,873 INFO L241 Difference]: Finished difference. Result has 43 places, 30 transitions, 76 flow [2021-03-26 00:11:26,873 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2021-03-26 00:11:26,873 INFO L343 CegarLoopForPetriNet]: 70 programPoint places, -27 predicate places. [2021-03-26 00:11:26,873 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:11:26,873 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 30 transitions, 76 flow [2021-03-26 00:11:26,874 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 30 transitions, 76 flow [2021-03-26 00:11:26,874 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 30 transitions, 76 flow [2021-03-26 00:11:26,882 INFO L129 PetriNetUnfolder]: 0/30 cut-off events. [2021-03-26 00:11:26,883 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:11:26,883 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 30 events. 0/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 49 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 00:11:26,883 INFO L142 LiptonReduction]: Number of co-enabled transitions 450 [2021-03-26 00:11:29,130 WARN L205 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 164 DAG size of output: 162 [2021-03-26 00:11:29,666 WARN L205 SmtUtils]: Spent 533.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2021-03-26 00:11:30,888 WARN L205 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 164 DAG size of output: 162 [2021-03-26 00:11:31,446 WARN L205 SmtUtils]: Spent 556.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2021-03-26 00:11:31,450 INFO L154 LiptonReduction]: Checked pairs total: 1144 [2021-03-26 00:11:31,450 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:11:31,450 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4577 [2021-03-26 00:11:31,451 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 74 flow [2021-03-26 00:11:31,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 223.66666666666666) internal successors, (671), 3 states have internal predecessors, (671), 0 states have call successors, (0), 0 states 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 00:11:31,452 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:11:31,452 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:11:31,452 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 00:11:31,452 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:11:31,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:11:31,452 INFO L82 PathProgramCache]: Analyzing trace with hash 841712283, now seen corresponding path program 1 times [2021-03-26 00:11:31,452 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:11:31,453 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113812802] [2021-03-26 00:11:31,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:11:31,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:11:31,566 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:31,569 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:11:31,575 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 00:11:31,576 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113812802] [2021-03-26 00:11:31,576 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:11:31,576 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 00:11:31,576 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537937253] [2021-03-26 00:11:31,577 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:11:31,577 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:11:31,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:11:31,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:11:31,581 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 246 [2021-03-26 00:11:31,582 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 224.66666666666666) internal successors, (674), 3 states have internal predecessors, (674), 0 states have call successors, (0), 0 states 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 00:11:31,582 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:11:31,582 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 246 [2021-03-26 00:11:31,582 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:11:31,609 INFO L129 PetriNetUnfolder]: 0/29 cut-off events. [2021-03-26 00:11:31,610 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-03-26 00:11:31,610 INFO L84 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 29 events. 0/29 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 49 event pairs, 0 based on Foata normal form. 1/30 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 00:11:31,610 INFO L132 encePairwiseOnDemand]: 243/246 looper letters, 1 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2021-03-26 00:11:31,610 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 29 transitions, 80 flow [2021-03-26 00:11:31,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:11:31,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:11:31,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 676 transitions. [2021-03-26 00:11:31,615 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9159891598915989 [2021-03-26 00:11:31,616 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 676 transitions. [2021-03-26 00:11:31,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 676 transitions. [2021-03-26 00:11:31,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:11:31,616 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 676 transitions. [2021-03-26 00:11:31,618 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 225.33333333333334) internal successors, (676), 3 states have internal predecessors, (676), 0 states have call successors, (0), 0 states 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 00:11:31,619 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:11:31,620 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:11:31,620 INFO L185 Difference]: Start difference. First operand has 41 places, 29 transitions, 74 flow. Second operand 3 states and 676 transitions. [2021-03-26 00:11:31,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 29 transitions, 80 flow [2021-03-26 00:11:31,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 29 transitions, 76 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:11:31,621 INFO L241 Difference]: Finished difference. Result has 42 places, 29 transitions, 78 flow [2021-03-26 00:11:31,622 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2021-03-26 00:11:31,622 INFO L343 CegarLoopForPetriNet]: 70 programPoint places, -28 predicate places. [2021-03-26 00:11:31,622 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:11:31,622 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 29 transitions, 78 flow [2021-03-26 00:11:31,622 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 29 transitions, 78 flow [2021-03-26 00:11:31,622 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 29 transitions, 78 flow [2021-03-26 00:11:31,632 INFO L129 PetriNetUnfolder]: 0/29 cut-off events. [2021-03-26 00:11:31,632 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 00:11:31,632 INFO L84 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 29 events. 0/29 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 48 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 00:11:31,633 INFO L142 LiptonReduction]: Number of co-enabled transitions 446 [2021-03-26 00:11:33,095 INFO L154 LiptonReduction]: Checked pairs total: 554 [2021-03-26 00:11:33,095 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:11:33,095 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1473 [2021-03-26 00:11:33,096 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 78 flow [2021-03-26 00:11:33,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 224.66666666666666) internal successors, (674), 3 states have internal predecessors, (674), 0 states have call successors, (0), 0 states 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 00:11:33,097 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:11:33,097 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:11:33,097 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 00:11:33,097 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:11:33,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:11:33,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1809604259, now seen corresponding path program 1 times [2021-03-26 00:11:33,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:11:33,098 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286170522] [2021-03-26 00:11:33,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:11:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:11:33,287 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:33,289 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:11:33,301 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:11:33,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:11:33,323 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:33,324 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:11:33,325 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 00:11:33,325 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286170522] [2021-03-26 00:11:33,325 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:11:33,325 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:11:33,325 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460500920] [2021-03-26 00:11:33,325 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:11:33,325 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:11:33,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:11:33,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:11:33,330 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 246 [2021-03-26 00:11:33,331 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 211.75) internal successors, (847), 4 states have internal predecessors, (847), 0 states have call successors, (0), 0 states 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 00:11:33,331 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:11:33,331 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 246 [2021-03-26 00:11:33,331 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:11:33,451 INFO L129 PetriNetUnfolder]: 90/188 cut-off events. [2021-03-26 00:11:33,451 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-03-26 00:11:33,452 INFO L84 FinitePrefix]: Finished finitePrefix Result has 387 conditions, 188 events. 90/188 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 832 event pairs, 46 based on Foata normal form. 16/202 useless extension candidates. Maximal degree in co-relation 376. Up to 119 conditions per place. [2021-03-26 00:11:33,453 INFO L132 encePairwiseOnDemand]: 239/246 looper letters, 6 selfloop transitions, 5 changer transitions 9/42 dead transitions. [2021-03-26 00:11:33,453 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 42 transitions, 144 flow [2021-03-26 00:11:33,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:11:33,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:11:33,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1077 transitions. [2021-03-26 00:11:33,459 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.875609756097561 [2021-03-26 00:11:33,459 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1077 transitions. [2021-03-26 00:11:33,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1077 transitions. [2021-03-26 00:11:33,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:11:33,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1077 transitions. [2021-03-26 00:11:33,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 215.4) internal successors, (1077), 5 states have internal predecessors, (1077), 0 states have call successors, (0), 0 states 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 00:11:33,464 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states 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 00:11:33,465 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states 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 00:11:33,465 INFO L185 Difference]: Start difference. First operand has 42 places, 29 transitions, 78 flow. Second operand 5 states and 1077 transitions. [2021-03-26 00:11:33,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 42 transitions, 144 flow [2021-03-26 00:11:33,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 42 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:11:33,467 INFO L241 Difference]: Finished difference. Result has 47 places, 33 transitions, 119 flow [2021-03-26 00:11:33,467 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=119, PETRI_PLACES=47, PETRI_TRANSITIONS=33} [2021-03-26 00:11:33,467 INFO L343 CegarLoopForPetriNet]: 70 programPoint places, -23 predicate places. [2021-03-26 00:11:33,467 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:11:33,467 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 33 transitions, 119 flow [2021-03-26 00:11:33,468 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 33 transitions, 119 flow [2021-03-26 00:11:33,468 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 33 transitions, 119 flow [2021-03-26 00:11:33,487 INFO L129 PetriNetUnfolder]: 73/149 cut-off events. [2021-03-26 00:11:33,488 INFO L130 PetriNetUnfolder]: For 78/78 co-relation queries the response was YES. [2021-03-26 00:11:33,488 INFO L84 FinitePrefix]: Finished finitePrefix Result has 406 conditions, 149 events. 73/149 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 600 event pairs, 40 based on Foata normal form. 0/146 useless extension candidates. Maximal degree in co-relation 394. Up to 104 conditions per place. [2021-03-26 00:11:33,490 INFO L142 LiptonReduction]: Number of co-enabled transitions 522 [2021-03-26 00:11:33,671 INFO L154 LiptonReduction]: Checked pairs total: 511 [2021-03-26 00:11:33,671 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:11:33,671 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 204 [2021-03-26 00:11:33,672 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 119 flow [2021-03-26 00:11:33,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 211.75) internal successors, (847), 4 states have internal predecessors, (847), 0 states have call successors, (0), 0 states 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 00:11:33,673 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:11:33,673 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 00:11:33,673 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 00:11:33,673 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:11:33,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:11:33,673 INFO L82 PathProgramCache]: Analyzing trace with hash -903845680, now seen corresponding path program 1 times [2021-03-26 00:11:33,673 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:11:33,673 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925505808] [2021-03-26 00:11:33,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:11:33,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:11:33,801 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:33,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:11:33,810 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:33,811 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:11:33,822 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:11:33,826 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:11:33,845 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:33,846 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:11:33,846 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 00:11:33,846 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925505808] [2021-03-26 00:11:33,848 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:11:33,848 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:11:33,848 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135140481] [2021-03-26 00:11:33,848 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:11:33,848 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:11:33,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:11:33,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:11:33,852 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 246 [2021-03-26 00:11:33,853 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 119 flow. Second operand has 5 states, 5 states have (on average 211.8) internal successors, (1059), 5 states have internal predecessors, (1059), 0 states have call successors, (0), 0 states 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 00:11:33,853 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:11:33,853 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 246 [2021-03-26 00:11:33,853 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:11:33,989 INFO L129 PetriNetUnfolder]: 66/151 cut-off events. [2021-03-26 00:11:33,989 INFO L130 PetriNetUnfolder]: For 108/125 co-relation queries the response was YES. [2021-03-26 00:11:33,990 INFO L84 FinitePrefix]: Finished finitePrefix Result has 532 conditions, 151 events. 66/151 cut-off events. For 108/125 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 582 event pairs, 14 based on Foata normal form. 22/171 useless extension candidates. Maximal degree in co-relation 518. Up to 108 conditions per place. [2021-03-26 00:11:33,990 INFO L132 encePairwiseOnDemand]: 239/246 looper letters, 6 selfloop transitions, 9 changer transitions 9/46 dead transitions. [2021-03-26 00:11:33,991 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 46 transitions, 243 flow [2021-03-26 00:11:33,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:11:33,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:11:33,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1292 transitions. [2021-03-26 00:11:33,997 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8753387533875339 [2021-03-26 00:11:33,997 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1292 transitions. [2021-03-26 00:11:33,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1292 transitions. [2021-03-26 00:11:33,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:11:33,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1292 transitions. [2021-03-26 00:11:34,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 215.33333333333334) internal successors, (1292), 6 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states 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 00:11:34,003 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 246.0) internal successors, (1722), 7 states have internal predecessors, (1722), 0 states have call successors, (0), 0 states 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 00:11:34,004 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 246.0) internal successors, (1722), 7 states have internal predecessors, (1722), 0 states have call successors, (0), 0 states 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 00:11:34,004 INFO L185 Difference]: Start difference. First operand has 45 places, 33 transitions, 119 flow. Second operand 6 states and 1292 transitions. [2021-03-26 00:11:34,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 46 transitions, 243 flow [2021-03-26 00:11:34,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 46 transitions, 236 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 00:11:34,008 INFO L241 Difference]: Finished difference. Result has 51 places, 37 transitions, 184 flow [2021-03-26 00:11:34,008 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=184, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2021-03-26 00:11:34,008 INFO L343 CegarLoopForPetriNet]: 70 programPoint places, -19 predicate places. [2021-03-26 00:11:34,008 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:11:34,008 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 37 transitions, 184 flow [2021-03-26 00:11:34,009 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 37 transitions, 184 flow [2021-03-26 00:11:34,009 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 37 transitions, 184 flow [2021-03-26 00:11:34,025 INFO L129 PetriNetUnfolder]: 49/117 cut-off events. [2021-03-26 00:11:34,025 INFO L130 PetriNetUnfolder]: For 182/197 co-relation queries the response was YES. [2021-03-26 00:11:34,026 INFO L84 FinitePrefix]: Finished finitePrefix Result has 459 conditions, 117 events. 49/117 cut-off events. For 182/197 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 432 event pairs, 13 based on Foata normal form. 4/118 useless extension candidates. Maximal degree in co-relation 444. Up to 76 conditions per place. [2021-03-26 00:11:34,027 INFO L142 LiptonReduction]: Number of co-enabled transitions 618 [2021-03-26 00:11:34,033 INFO L154 LiptonReduction]: Checked pairs total: 609 [2021-03-26 00:11:34,033 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:11:34,033 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 25 [2021-03-26 00:11:34,035 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 37 transitions, 184 flow [2021-03-26 00:11:34,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 211.8) internal successors, (1059), 5 states have internal predecessors, (1059), 0 states have call successors, (0), 0 states 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 00:11:34,035 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:11:34,035 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:11:34,035 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 00:11:34,035 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:11:34,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:11:34,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1307017569, now seen corresponding path program 1 times [2021-03-26 00:11:34,036 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:11:34,036 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807439426] [2021-03-26 00:11:34,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:11:34,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:11:34,239 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:34,240 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:11:34,248 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:34,249 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:11:34,260 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:34,261 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:11:34,275 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:11:34,277 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:11:34,297 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:34,298 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:11:34,299 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 00:11:34,299 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807439426] [2021-03-26 00:11:34,299 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:11:34,299 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:11:34,299 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908872398] [2021-03-26 00:11:34,299 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:11:34,299 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:11:34,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:11:34,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:11:34,301 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 246 [2021-03-26 00:11:34,302 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 184 flow. Second operand has 6 states, 6 states have (on average 211.83333333333334) internal successors, (1271), 6 states have internal predecessors, (1271), 0 states have call successors, (0), 0 states 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 00:11:34,302 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:11:34,302 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 246 [2021-03-26 00:11:34,302 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:11:34,478 INFO L129 PetriNetUnfolder]: 36/99 cut-off events. [2021-03-26 00:11:34,478 INFO L130 PetriNetUnfolder]: For 192/232 co-relation queries the response was YES. [2021-03-26 00:11:34,478 INFO L84 FinitePrefix]: Finished finitePrefix Result has 457 conditions, 99 events. 36/99 cut-off events. For 192/232 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 305 event pairs, 2 based on Foata normal form. 25/122 useless extension candidates. Maximal degree in co-relation 440. Up to 68 conditions per place. [2021-03-26 00:11:34,479 INFO L132 encePairwiseOnDemand]: 239/246 looper letters, 6 selfloop transitions, 13 changer transitions 9/50 dead transitions. [2021-03-26 00:11:34,479 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 50 transitions, 366 flow [2021-03-26 00:11:34,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:11:34,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:11:34,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1507 transitions. [2021-03-26 00:11:34,490 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8751451800232288 [2021-03-26 00:11:34,490 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1507 transitions. [2021-03-26 00:11:34,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1507 transitions. [2021-03-26 00:11:34,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:11:34,491 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1507 transitions. [2021-03-26 00:11:34,494 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 215.28571428571428) internal successors, (1507), 7 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states 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 00:11:34,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 246.0) internal successors, (1968), 8 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states 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 00:11:34,497 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 246.0) internal successors, (1968), 8 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states 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 00:11:34,498 INFO L185 Difference]: Start difference. First operand has 49 places, 37 transitions, 184 flow. Second operand 7 states and 1507 transitions. [2021-03-26 00:11:34,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 50 transitions, 366 flow [2021-03-26 00:11:34,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 50 transitions, 304 flow, removed 26 selfloop flow, removed 4 redundant places. [2021-03-26 00:11:34,503 INFO L241 Difference]: Finished difference. Result has 54 places, 41 transitions, 234 flow [2021-03-26 00:11:34,503 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=234, PETRI_PLACES=54, PETRI_TRANSITIONS=41} [2021-03-26 00:11:34,503 INFO L343 CegarLoopForPetriNet]: 70 programPoint places, -16 predicate places. [2021-03-26 00:11:34,503 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:11:34,503 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 41 transitions, 234 flow [2021-03-26 00:11:34,504 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 41 transitions, 234 flow [2021-03-26 00:11:34,504 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 41 transitions, 234 flow [2021-03-26 00:11:34,515 INFO L129 PetriNetUnfolder]: 25/76 cut-off events. [2021-03-26 00:11:34,515 INFO L130 PetriNetUnfolder]: For 129/144 co-relation queries the response was YES. [2021-03-26 00:11:34,516 INFO L84 FinitePrefix]: Finished finitePrefix Result has 292 conditions, 76 events. 25/76 cut-off events. For 129/144 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 203 event pairs, 2 based on Foata normal form. 4/77 useless extension candidates. Maximal degree in co-relation 276. Up to 42 conditions per place. [2021-03-26 00:11:34,516 INFO L142 LiptonReduction]: Number of co-enabled transitions 618 [2021-03-26 00:11:34,521 INFO L154 LiptonReduction]: Checked pairs total: 656 [2021-03-26 00:11:34,521 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:11:34,521 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 18 [2021-03-26 00:11:34,522 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 234 flow [2021-03-26 00:11:34,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 211.83333333333334) internal successors, (1271), 6 states have internal predecessors, (1271), 0 states have call successors, (0), 0 states 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 00:11:34,523 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:11:34,523 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:11:34,523 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 00:11:34,523 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:11:34,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:11:34,524 INFO L82 PathProgramCache]: Analyzing trace with hash -236533964, now seen corresponding path program 1 times [2021-03-26 00:11:34,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:11:34,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470206884] [2021-03-26 00:11:34,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:11:34,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:11:34,602 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:34,603 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:11:34,604 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:34,605 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:11:34,611 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:34,612 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:11:34,620 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 00:11:34,621 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470206884] [2021-03-26 00:11:34,621 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:11:34,621 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:11:34,621 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894411055] [2021-03-26 00:11:34,621 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:11:34,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:11:34,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:11:34,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:11:34,623 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 246 [2021-03-26 00:11:34,624 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 234 flow. Second operand has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:11:34,624 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:11:34,624 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 246 [2021-03-26 00:11:34,624 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:11:34,728 INFO L129 PetriNetUnfolder]: 50/134 cut-off events. [2021-03-26 00:11:34,729 INFO L130 PetriNetUnfolder]: For 295/327 co-relation queries the response was YES. [2021-03-26 00:11:34,729 INFO L84 FinitePrefix]: Finished finitePrefix Result has 552 conditions, 134 events. 50/134 cut-off events. For 295/327 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 481 event pairs, 4 based on Foata normal form. 11/138 useless extension candidates. Maximal degree in co-relation 534. Up to 82 conditions per place. [2021-03-26 00:11:34,730 INFO L132 encePairwiseOnDemand]: 243/246 looper letters, 4 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2021-03-26 00:11:34,730 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 43 transitions, 254 flow [2021-03-26 00:11:34,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:11:34,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:11:34,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 887 transitions. [2021-03-26 00:11:34,735 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9014227642276422 [2021-03-26 00:11:34,736 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 887 transitions. [2021-03-26 00:11:34,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 887 transitions. [2021-03-26 00:11:34,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:11:34,736 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 887 transitions. [2021-03-26 00:11:34,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 221.75) internal successors, (887), 4 states have internal predecessors, (887), 0 states have call successors, (0), 0 states 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 00:11:34,739 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states 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 00:11:34,740 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states 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 00:11:34,740 INFO L185 Difference]: Start difference. First operand has 52 places, 41 transitions, 234 flow. Second operand 4 states and 887 transitions. [2021-03-26 00:11:34,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 43 transitions, 254 flow [2021-03-26 00:11:34,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 43 transitions, 200 flow, removed 18 selfloop flow, removed 5 redundant places. [2021-03-26 00:11:34,744 INFO L241 Difference]: Finished difference. Result has 52 places, 42 transitions, 193 flow [2021-03-26 00:11:34,744 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=193, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2021-03-26 00:11:34,744 INFO L343 CegarLoopForPetriNet]: 70 programPoint places, -18 predicate places. [2021-03-26 00:11:34,745 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:11:34,745 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 42 transitions, 193 flow [2021-03-26 00:11:34,745 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 42 transitions, 193 flow [2021-03-26 00:11:34,745 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 42 transitions, 193 flow [2021-03-26 00:11:34,763 INFO L129 PetriNetUnfolder]: 49/132 cut-off events. [2021-03-26 00:11:34,763 INFO L130 PetriNetUnfolder]: For 186/202 co-relation queries the response was YES. [2021-03-26 00:11:34,763 INFO L84 FinitePrefix]: Finished finitePrefix Result has 398 conditions, 132 events. 49/132 cut-off events. For 186/202 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 484 event pairs, 4 based on Foata normal form. 6/130 useless extension candidates. Maximal degree in co-relation 383. Up to 60 conditions per place. [2021-03-26 00:11:34,765 INFO L142 LiptonReduction]: Number of co-enabled transitions 636 [2021-03-26 00:11:35,123 INFO L154 LiptonReduction]: Checked pairs total: 642 [2021-03-26 00:11:35,123 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:11:35,123 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 378 [2021-03-26 00:11:35,124 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 193 flow [2021-03-26 00:11:35,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:11:35,125 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:11:35,125 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:11:35,125 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 00:11:35,125 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:11:35,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:11:35,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1366560680, now seen corresponding path program 2 times [2021-03-26 00:11:35,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:11:35,126 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060572698] [2021-03-26 00:11:35,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:11:35,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:11:35,290 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:35,291 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:11:35,299 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:35,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:11:35,311 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:35,312 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:11:35,325 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:35,327 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:11:35,343 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:11:35,344 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:11:35,366 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:11:35,368 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:11:35,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:11:35,368 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060572698] [2021-03-26 00:11:35,368 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:11:35,368 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 00:11:35,368 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720673722] [2021-03-26 00:11:35,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:11:35,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:11:35,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:11:35,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:11:35,371 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 246 [2021-03-26 00:11:35,372 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 193 flow. Second operand has 7 states, 7 states have (on average 211.85714285714286) internal successors, (1483), 7 states have internal predecessors, (1483), 0 states have call successors, (0), 0 states 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 00:11:35,372 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:11:35,372 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 246 [2021-03-26 00:11:35,372 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:11:35,580 INFO L129 PetriNetUnfolder]: 39/108 cut-off events. [2021-03-26 00:11:35,581 INFO L130 PetriNetUnfolder]: For 161/247 co-relation queries the response was YES. [2021-03-26 00:11:35,581 INFO L84 FinitePrefix]: Finished finitePrefix Result has 395 conditions, 108 events. 39/108 cut-off events. For 161/247 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 347 event pairs, 0 based on Foata normal form. 37/138 useless extension candidates. Maximal degree in co-relation 378. Up to 51 conditions per place. [2021-03-26 00:11:35,582 INFO L132 encePairwiseOnDemand]: 239/246 looper letters, 2 selfloop transitions, 17 changer transitions 5/47 dead transitions. [2021-03-26 00:11:35,582 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 47 transitions, 289 flow [2021-03-26 00:11:35,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 00:11:35,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 00:11:35,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1714 transitions. [2021-03-26 00:11:35,589 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8709349593495935 [2021-03-26 00:11:35,589 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1714 transitions. [2021-03-26 00:11:35,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1714 transitions. [2021-03-26 00:11:35,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:11:35,590 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1714 transitions. [2021-03-26 00:11:35,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 214.25) internal successors, (1714), 8 states have internal predecessors, (1714), 0 states have call successors, (0), 0 states 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 00:11:35,598 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 246.0) internal successors, (2214), 9 states have internal predecessors, (2214), 0 states have call successors, (0), 0 states 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 00:11:35,598 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 246.0) internal successors, (2214), 9 states have internal predecessors, (2214), 0 states have call successors, (0), 0 states 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 00:11:35,598 INFO L185 Difference]: Start difference. First operand has 52 places, 42 transitions, 193 flow. Second operand 8 states and 1714 transitions. [2021-03-26 00:11:35,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 47 transitions, 289 flow [2021-03-26 00:11:35,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 47 transitions, 264 flow, removed 10 selfloop flow, removed 3 redundant places. [2021-03-26 00:11:35,600 INFO L241 Difference]: Finished difference. Result has 59 places, 42 transitions, 224 flow [2021-03-26 00:11:35,600 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=224, PETRI_PLACES=59, PETRI_TRANSITIONS=42} [2021-03-26 00:11:35,601 INFO L343 CegarLoopForPetriNet]: 70 programPoint places, -11 predicate places. [2021-03-26 00:11:35,601 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:11:35,601 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 42 transitions, 224 flow [2021-03-26 00:11:35,601 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 42 transitions, 224 flow [2021-03-26 00:11:35,601 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 42 transitions, 224 flow [2021-03-26 00:11:35,613 INFO L129 PetriNetUnfolder]: 33/92 cut-off events. [2021-03-26 00:11:35,613 INFO L130 PetriNetUnfolder]: For 120/138 co-relation queries the response was YES. [2021-03-26 00:11:35,614 INFO L84 FinitePrefix]: Finished finitePrefix Result has 305 conditions, 92 events. 33/92 cut-off events. For 120/138 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 289 event pairs, 0 based on Foata normal form. 1/85 useless extension candidates. Maximal degree in co-relation 288. Up to 35 conditions per place. [2021-03-26 00:11:35,615 INFO L142 LiptonReduction]: Number of co-enabled transitions 554 [2021-03-26 00:11:39,967 WARN L205 SmtUtils]: Spent 4.35 s on a formula simplification. DAG size of input: 441 DAG size of output: 334 [2021-03-26 00:11:41,411 WARN L205 SmtUtils]: Spent 1.44 s on a formula simplification that was a NOOP. DAG size: 302 [2021-03-26 00:11:51,605 WARN L205 SmtUtils]: Spent 10.19 s on a formula simplification. DAG size of input: 643 DAG size of output: 487 [2021-03-26 00:11:55,396 WARN L205 SmtUtils]: Spent 3.78 s on a formula simplification that was a NOOP. DAG size: 452 [2021-03-26 00:11:57,260 WARN L205 SmtUtils]: Spent 1.85 s on a formula simplification that was a NOOP. DAG size: 314 [2021-03-26 00:11:59,246 WARN L205 SmtUtils]: Spent 1.98 s on a formula simplification that was a NOOP. DAG size: 314 [2021-03-26 00:12:03,354 WARN L205 SmtUtils]: Spent 4.10 s on a formula simplification that was a NOOP. DAG size: 464 [2021-03-26 00:12:07,560 WARN L205 SmtUtils]: Spent 4.20 s on a formula simplification that was a NOOP. DAG size: 464 [2021-03-26 00:12:07,568 INFO L154 LiptonReduction]: Checked pairs total: 1773 [2021-03-26 00:12:07,569 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 00:12:07,569 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 31968 [2021-03-26 00:12:07,570 INFO L480 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 220 flow [2021-03-26 00:12:07,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 211.85714285714286) internal successors, (1483), 7 states have internal predecessors, (1483), 0 states have call successors, (0), 0 states 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 00:12:07,570 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:12:07,570 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:12:07,570 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 00:12:07,571 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:12:07,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:12:07,571 INFO L82 PathProgramCache]: Analyzing trace with hash -943501410, now seen corresponding path program 1 times [2021-03-26 00:12:07,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:12:07,571 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124771251] [2021-03-26 00:12:07,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:12:07,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:12:07,693 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:07,695 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:12:07,718 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:07,720 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:12:07,754 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:07,756 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 00:12:07,829 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:07,831 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 00:12:07,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:07,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:12:07,885 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 00:12:07,885 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124771251] [2021-03-26 00:12:07,885 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:12:07,885 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:12:07,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110609679] [2021-03-26 00:12:07,886 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:12:07,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:12:07,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:12:07,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:12:07,887 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 248 [2021-03-26 00:12:07,888 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 220 flow. Second operand has 6 states, 6 states have (on average 204.33333333333334) internal successors, (1226), 6 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states 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 00:12:07,888 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:12:07,888 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 248 [2021-03-26 00:12:07,889 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:12:08,095 INFO L129 PetriNetUnfolder]: 95/220 cut-off events. [2021-03-26 00:12:08,095 INFO L130 PetriNetUnfolder]: For 541/616 co-relation queries the response was YES. [2021-03-26 00:12:08,097 INFO L84 FinitePrefix]: Finished finitePrefix Result has 740 conditions, 220 events. 95/220 cut-off events. For 541/616 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1077 event pairs, 0 based on Foata normal form. 17/212 useless extension candidates. Maximal degree in co-relation 721. Up to 82 conditions per place. [2021-03-26 00:12:08,098 INFO L132 encePairwiseOnDemand]: 243/248 looper letters, 7 selfloop transitions, 4 changer transitions 0/44 dead transitions. [2021-03-26 00:12:08,098 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 44 transitions, 250 flow [2021-03-26 00:12:08,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:12:08,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:12:08,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 824 transitions. [2021-03-26 00:12:08,105 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8306451612903226 [2021-03-26 00:12:08,105 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 824 transitions. [2021-03-26 00:12:08,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 824 transitions. [2021-03-26 00:12:08,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:12:08,105 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 824 transitions. [2021-03-26 00:12:08,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states 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 00:12:08,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states 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 00:12:08,109 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states 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 00:12:08,109 INFO L185 Difference]: Start difference. First operand has 55 places, 40 transitions, 220 flow. Second operand 4 states and 824 transitions. [2021-03-26 00:12:08,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 44 transitions, 250 flow [2021-03-26 00:12:08,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 44 transitions, 194 flow, removed 15 selfloop flow, removed 7 redundant places. [2021-03-26 00:12:08,112 INFO L241 Difference]: Finished difference. Result has 52 places, 42 transitions, 185 flow [2021-03-26 00:12:08,112 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=185, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2021-03-26 00:12:08,113 INFO L343 CegarLoopForPetriNet]: 70 programPoint places, -18 predicate places. [2021-03-26 00:12:08,113 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:12:08,113 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 42 transitions, 185 flow [2021-03-26 00:12:08,113 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 42 transitions, 185 flow [2021-03-26 00:12:08,113 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 42 transitions, 185 flow [2021-03-26 00:12:08,129 INFO L129 PetriNetUnfolder]: 75/176 cut-off events. [2021-03-26 00:12:08,129 INFO L130 PetriNetUnfolder]: For 146/162 co-relation queries the response was YES. [2021-03-26 00:12:08,130 INFO L84 FinitePrefix]: Finished finitePrefix Result has 473 conditions, 176 events. 75/176 cut-off events. For 146/162 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 783 event pairs, 0 based on Foata normal form. 5/162 useless extension candidates. Maximal degree in co-relation 458. Up to 56 conditions per place. [2021-03-26 00:12:08,131 INFO L142 LiptonReduction]: Number of co-enabled transitions 606 [2021-03-26 00:12:08,135 INFO L154 LiptonReduction]: Checked pairs total: 481 [2021-03-26 00:12:08,135 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:12:08,135 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 22 [2021-03-26 00:12:08,136 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 185 flow [2021-03-26 00:12:08,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 204.33333333333334) internal successors, (1226), 6 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states 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 00:12:08,137 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:12:08,137 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:12:08,137 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 00:12:08,137 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:12:08,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:12:08,137 INFO L82 PathProgramCache]: Analyzing trace with hash -469865553, now seen corresponding path program 1 times [2021-03-26 00:12:08,138 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:12:08,138 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989581745] [2021-03-26 00:12:08,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:12:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:12:08,260 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:08,262 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:12:08,263 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:08,265 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:12:08,276 INFO L142 QuantifierPusher]: treesize reduction 2, result has 92.0 percent of original size [2021-03-26 00:12:08,277 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 00:12:08,326 INFO L142 QuantifierPusher]: treesize reduction 12, result has 80.3 percent of original size [2021-03-26 00:12:08,328 INFO L147 QuantifierPusher]: treesize reduction 4, result has 91.8 percent of original size 45 [2021-03-26 00:12:08,403 INFO L142 QuantifierPusher]: treesize reduction 16, result has 73.8 percent of original size [2021-03-26 00:12:08,405 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-26 00:12:08,460 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:08,462 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:12:08,481 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 00:12:08,481 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989581745] [2021-03-26 00:12:08,481 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:12:08,481 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 00:12:08,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289316695] [2021-03-26 00:12:08,482 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:12:08,482 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:12:08,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:12:08,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:12:08,483 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 248 [2021-03-26 00:12:08,486 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 185 flow. Second operand has 7 states, 7 states have (on average 202.42857142857142) internal successors, (1417), 7 states have internal predecessors, (1417), 0 states have call successors, (0), 0 states 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 00:12:08,486 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:12:08,486 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 248 [2021-03-26 00:12:08,486 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:12:09,251 INFO L129 PetriNetUnfolder]: 1039/2048 cut-off events. [2021-03-26 00:12:09,252 INFO L130 PetriNetUnfolder]: For 2507/3079 co-relation queries the response was YES. [2021-03-26 00:12:09,262 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5462 conditions, 2048 events. 1039/2048 cut-off events. For 2507/3079 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 15999 event pairs, 59 based on Foata normal form. 147/1948 useless extension candidates. Maximal degree in co-relation 5445. Up to 496 conditions per place. [2021-03-26 00:12:09,266 INFO L132 encePairwiseOnDemand]: 240/248 looper letters, 13 selfloop transitions, 1 changer transitions 24/69 dead transitions. [2021-03-26 00:12:09,266 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 69 transitions, 337 flow [2021-03-26 00:12:09,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:12:09,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:12:09,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1442 transitions. [2021-03-26 00:12:09,274 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8306451612903226 [2021-03-26 00:12:09,274 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1442 transitions. [2021-03-26 00:12:09,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1442 transitions. [2021-03-26 00:12:09,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:12:09,275 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1442 transitions. [2021-03-26 00:12:09,278 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 206.0) internal successors, (1442), 7 states have internal predecessors, (1442), 0 states have call successors, (0), 0 states 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 00:12:09,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 248.0) internal successors, (1984), 8 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states 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 00:12:09,281 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 248.0) internal successors, (1984), 8 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states 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 00:12:09,282 INFO L185 Difference]: Start difference. First operand has 52 places, 42 transitions, 185 flow. Second operand 7 states and 1442 transitions. [2021-03-26 00:12:09,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 69 transitions, 337 flow [2021-03-26 00:12:09,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 69 transitions, 328 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:12:09,333 INFO L241 Difference]: Finished difference. Result has 61 places, 42 transitions, 203 flow [2021-03-26 00:12:09,333 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=203, PETRI_PLACES=61, PETRI_TRANSITIONS=42} [2021-03-26 00:12:09,333 INFO L343 CegarLoopForPetriNet]: 70 programPoint places, -9 predicate places. [2021-03-26 00:12:09,333 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:12:09,333 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 42 transitions, 203 flow [2021-03-26 00:12:09,334 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 42 transitions, 203 flow [2021-03-26 00:12:09,334 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 42 transitions, 203 flow [2021-03-26 00:12:09,402 INFO L129 PetriNetUnfolder]: 276/624 cut-off events. [2021-03-26 00:12:09,402 INFO L130 PetriNetUnfolder]: For 479/519 co-relation queries the response was YES. [2021-03-26 00:12:09,405 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1672 conditions, 624 events. 276/624 cut-off events. For 479/519 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4018 event pairs, 85 based on Foata normal form. 7/524 useless extension candidates. Maximal degree in co-relation 1653. Up to 207 conditions per place. [2021-03-26 00:12:09,442 INFO L142 LiptonReduction]: Number of co-enabled transitions 548 [2021-03-26 00:12:09,925 INFO L154 LiptonReduction]: Checked pairs total: 405 [2021-03-26 00:12:09,925 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:12:09,926 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 593 [2021-03-26 00:12:09,926 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 41 transitions, 201 flow [2021-03-26 00:12:09,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 202.42857142857142) internal successors, (1417), 7 states have internal predecessors, (1417), 0 states have call successors, (0), 0 states 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 00:12:09,927 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:12:09,927 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:12:09,927 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 00:12:09,927 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:12:09,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:12:09,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1627044461, now seen corresponding path program 2 times [2021-03-26 00:12:09,928 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:12:09,928 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140106905] [2021-03-26 00:12:09,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:12:10,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:12:10,039 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:12:10,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:12:10,177 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:12:10,229 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 00:12:10,229 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 00:12:10,230 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 00:12:10,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 12:12:10 BasicIcfg [2021-03-26 00:12:10,405 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 00:12:10,405 INFO L168 Benchmark]: Toolchain (without parser) took 111884.52 ms. Allocated memory was 255.9 MB in the beginning and 824.2 MB in the end (delta: 568.3 MB). Free memory was 232.9 MB in the beginning and 618.2 MB in the end (delta: -385.2 MB). Peak memory consumption was 182.5 MB. Max. memory is 16.0 GB. [2021-03-26 00:12:10,405 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 255.9 MB. Free memory is still 237.9 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:12:10,406 INFO L168 Benchmark]: CACSL2BoogieTranslator took 622.07 ms. Allocated memory was 255.9 MB in the beginning and 346.0 MB in the end (delta: 90.2 MB). Free memory was 232.5 MB in the beginning and 298.6 MB in the end (delta: -66.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:12:10,406 INFO L168 Benchmark]: Boogie Procedure Inliner took 101.92 ms. Allocated memory is still 346.0 MB. Free memory was 298.6 MB in the beginning and 293.9 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-26 00:12:10,406 INFO L168 Benchmark]: Boogie Preprocessor took 84.84 ms. Allocated memory is still 346.0 MB. Free memory was 293.9 MB in the beginning and 289.7 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-26 00:12:10,407 INFO L168 Benchmark]: RCFGBuilder took 4364.95 ms. Allocated memory was 346.0 MB in the beginning and 415.2 MB in the end (delta: 69.2 MB). Free memory was 289.7 MB in the beginning and 294.2 MB in the end (delta: -4.5 MB). Peak memory consumption was 158.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:12:10,410 INFO L168 Benchmark]: TraceAbstraction took 106704.93 ms. Allocated memory was 415.2 MB in the beginning and 824.2 MB in the end (delta: 408.9 MB). Free memory was 293.1 MB in the beginning and 618.2 MB in the end (delta: -325.0 MB). Peak memory consumption was 83.9 MB. Max. memory is 16.0 GB. [2021-03-26 00:12:10,411 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.51 ms. Allocated memory is still 255.9 MB. Free memory is still 237.9 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 622.07 ms. Allocated memory was 255.9 MB in the beginning and 346.0 MB in the end (delta: 90.2 MB). Free memory was 232.5 MB in the beginning and 298.6 MB in the end (delta: -66.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 101.92 ms. Allocated memory is still 346.0 MB. Free memory was 298.6 MB in the beginning and 293.9 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 84.84 ms. Allocated memory is still 346.0 MB. Free memory was 293.9 MB in the beginning and 289.7 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 4364.95 ms. Allocated memory was 346.0 MB in the beginning and 415.2 MB in the end (delta: 69.2 MB). Free memory was 289.7 MB in the beginning and 294.2 MB in the end (delta: -4.5 MB). Peak memory consumption was 158.1 MB. Max. memory is 16.0 GB. * TraceAbstraction took 106704.93 ms. Allocated memory was 415.2 MB in the beginning and 824.2 MB in the end (delta: 408.9 MB). Free memory was 293.1 MB in the beginning and 618.2 MB in the end (delta: -325.0 MB). Peak memory consumption was 83.9 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 22525.5ms, 145 PlacesBefore, 70 PlacesAfterwards, 134 TransitionsBefore, 58 TransitionsAfterwards, 2988 CoEnabledTransitionPairs, 5 FixpointIterations, 41 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 86 TotalNumberOfCompositions, 6284 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2637, positive: 2503, positive conditional: 2503, positive unconditional: 0, negative: 134, negative conditional: 134, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1893, positive: 1835, positive conditional: 0, positive unconditional: 1835, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1893, positive: 1835, positive conditional: 0, positive unconditional: 1835, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1893, positive: 1831, positive conditional: 0, positive unconditional: 1831, negative: 62, negative conditional: 0, negative unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 62, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1741, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 1729, negative conditional: 0, negative unconditional: 1729, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2637, positive: 668, positive conditional: 668, positive unconditional: 0, negative: 76, negative conditional: 76, negative unconditional: 0, unknown: 1893, unknown conditional: 1893, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 184, Positive cache size: 148, Positive conditional cache size: 148, Positive unconditional cache size: 0, Negative cache size: 36, Negative conditional cache size: 36, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 37384.5ms, 66 PlacesBefore, 48 PlacesAfterwards, 55 TransitionsBefore, 37 TransitionsAfterwards, 752 CoEnabledTransitionPairs, 4 FixpointIterations, 14 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 18 TotalNumberOfCompositions, 3191 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 749, positive: 616, positive conditional: 616, positive unconditional: 0, negative: 133, negative conditional: 133, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 155, positive: 138, positive conditional: 10, positive unconditional: 128, negative: 17, negative conditional: 1, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 155, positive: 138, positive conditional: 10, positive unconditional: 128, negative: 17, negative conditional: 1, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 155, positive: 135, positive conditional: 0, positive unconditional: 135, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 20, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 17, negative conditional: 1, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 674, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 662, negative conditional: 37, negative unconditional: 625, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 749, positive: 478, positive conditional: 478, positive unconditional: 0, negative: 116, negative conditional: 116, negative unconditional: 0, unknown: 155, unknown conditional: 155, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 204, Positive cache size: 160, Positive conditional cache size: 160, Positive unconditional cache size: 0, Negative cache size: 44, Negative conditional cache size: 44, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1788.0ms, 47 PlacesBefore, 42 PlacesAfterwards, 34 TransitionsBefore, 31 TransitionsAfterwards, 490 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 1920 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 475, positive: 379, positive conditional: 379, positive unconditional: 0, negative: 96, negative conditional: 96, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, positive: 17, positive conditional: 7, positive unconditional: 10, negative: 2, negative conditional: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, positive: 17, positive conditional: 7, positive unconditional: 10, negative: 2, negative conditional: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 78, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 78, negative conditional: 50, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 475, positive: 362, positive conditional: 362, positive unconditional: 0, negative: 94, negative conditional: 94, negative unconditional: 0, unknown: 19, unknown conditional: 19, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 223, Positive cache size: 177, Positive conditional cache size: 177, Positive unconditional cache size: 0, Negative cache size: 46, Negative conditional cache size: 46, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4576.2ms, 43 PlacesBefore, 41 PlacesAfterwards, 30 TransitionsBefore, 29 TransitionsAfterwards, 450 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1144 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 292, positive: 232, positive conditional: 232, positive unconditional: 0, negative: 60, negative conditional: 60, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 16, negative conditional: 12, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 26, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 16, negative conditional: 12, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 26, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 16, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 16, negative conditional: 12, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1121, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1121, negative conditional: 920, negative unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 292, positive: 222, positive conditional: 222, positive unconditional: 0, negative: 44, negative conditional: 44, negative unconditional: 0, unknown: 26, unknown conditional: 26, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 249, Positive cache size: 187, Positive conditional cache size: 187, Positive unconditional cache size: 0, Negative cache size: 62, Negative conditional cache size: 62, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1472.9ms, 42 PlacesBefore, 42 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 446 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 554 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 115, positive: 86, positive conditional: 86, positive unconditional: 0, negative: 29, negative conditional: 29, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23, positive: 6, positive conditional: 2, positive unconditional: 4, negative: 17, negative conditional: 1, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 23, positive: 6, positive conditional: 2, positive unconditional: 4, negative: 17, negative conditional: 1, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 23, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 17, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 17, negative conditional: 1, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1458, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1458, negative conditional: 156, negative unconditional: 1302, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 115, positive: 80, positive conditional: 80, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 23, unknown conditional: 23, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 272, Positive cache size: 193, Positive conditional cache size: 193, Positive unconditional cache size: 0, Negative cache size: 79, Negative conditional cache size: 79, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 203.7ms, 47 PlacesBefore, 45 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 522 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 511 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 53, positive: 30, positive conditional: 30, positive unconditional: 0, negative: 23, negative conditional: 23, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 178, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 178, negative conditional: 0, negative unconditional: 178, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 53, positive: 30, positive conditional: 30, positive unconditional: 0, negative: 19, negative conditional: 19, negative unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 276, Positive cache size: 193, Positive conditional cache size: 193, Positive unconditional cache size: 0, Negative cache size: 83, Negative conditional cache size: 83, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 24.2ms, 51 PlacesBefore, 49 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 618 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 609 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 95, positive: 71, positive conditional: 71, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, positive: 34, positive conditional: 28, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 34, positive: 34, positive conditional: 28, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 34, positive: 34, positive conditional: 0, positive unconditional: 34, 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: 95, positive: 37, positive conditional: 37, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 34, unknown conditional: 34, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 310, Positive cache size: 227, Positive conditional cache size: 227, Positive unconditional cache size: 0, Negative cache size: 83, Negative conditional cache size: 83, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 17.9ms, 54 PlacesBefore, 52 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 618 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 656 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 97, positive: 71, positive conditional: 71, positive unconditional: 0, negative: 26, negative conditional: 26, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, positive: 28, positive conditional: 28, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 28, positive: 28, positive conditional: 28, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 28, positive: 28, positive conditional: 0, positive unconditional: 28, 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: 97, positive: 43, positive conditional: 43, positive unconditional: 0, negative: 26, negative conditional: 26, negative unconditional: 0, unknown: 28, unknown conditional: 28, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 338, Positive cache size: 255, Positive conditional cache size: 255, Positive unconditional cache size: 0, Negative cache size: 83, Negative conditional cache size: 83, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 378.3ms, 52 PlacesBefore, 52 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 636 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 642 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 127, positive: 102, positive conditional: 102, positive unconditional: 0, negative: 25, negative conditional: 25, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50, positive: 44, positive conditional: 40, positive unconditional: 4, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 50, positive: 44, positive conditional: 40, positive unconditional: 4, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 50, positive: 44, positive conditional: 0, positive unconditional: 44, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 349, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 349, negative conditional: 0, negative unconditional: 349, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 127, positive: 58, positive conditional: 58, positive unconditional: 0, negative: 19, negative conditional: 19, negative unconditional: 0, unknown: 50, unknown conditional: 50, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 388, Positive cache size: 299, Positive conditional cache size: 299, Positive unconditional cache size: 0, Negative cache size: 89, Negative conditional cache size: 89, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 31967.6ms, 59 PlacesBefore, 55 PlacesAfterwards, 42 TransitionsBefore, 40 TransitionsAfterwards, 554 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 1773 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 262, positive: 184, positive conditional: 184, positive unconditional: 0, negative: 78, negative conditional: 78, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, positive: 17, positive conditional: 17, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, positive: 17, positive conditional: 17, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 262, positive: 167, positive conditional: 167, positive unconditional: 0, negative: 78, negative conditional: 78, negative unconditional: 0, unknown: 17, unknown conditional: 17, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 343, Positive cache size: 297, Positive conditional cache size: 297, Positive unconditional cache size: 0, Negative cache size: 46, Negative conditional cache size: 46, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 22.3ms, 52 PlacesBefore, 52 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 606 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 481 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 85, positive: 66, positive conditional: 66, positive unconditional: 0, negative: 19, negative conditional: 19, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 8, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 8, 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: 10, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 85, positive: 56, positive conditional: 56, positive unconditional: 0, negative: 19, negative conditional: 19, negative unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 353, Positive cache size: 307, Positive conditional cache size: 307, Positive unconditional cache size: 0, Negative cache size: 46, Negative conditional cache size: 46, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 591.9ms, 61 PlacesBefore, 56 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 548 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 405 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 137, positive: 121, positive conditional: 121, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 48, positive: 44, positive conditional: 23, positive unconditional: 21, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 48, positive: 44, positive conditional: 23, positive unconditional: 21, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 48, positive: 44, positive conditional: 0, positive unconditional: 44, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 375, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 375, negative conditional: 0, negative unconditional: 375, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 137, positive: 77, positive conditional: 77, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 48, unknown conditional: 48, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 303, Positive cache size: 259, Positive conditional cache size: 259, Positive unconditional cache size: 0, Negative cache size: 44, Negative conditional cache size: 44, Negative unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff0_thd4; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$r_buff1_thd4; [L737] 0 _Bool x$read_delayed; [L738] 0 int *x$read_delayed_var; [L739] 0 int x$w_buff0; [L740] 0 _Bool x$w_buff0_used; [L741] 0 int x$w_buff1; [L742] 0 _Bool x$w_buff1_used; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool z$flush_delayed; [L748] 0 int z$mem_tmp; [L749] 0 _Bool z$r_buff0_thd0; [L750] 0 _Bool z$r_buff0_thd1; [L751] 0 _Bool z$r_buff0_thd2; [L752] 0 _Bool z$r_buff0_thd3; [L753] 0 _Bool z$r_buff0_thd4; [L754] 0 _Bool z$r_buff1_thd0; [L755] 0 _Bool z$r_buff1_thd1; [L756] 0 _Bool z$r_buff1_thd2; [L757] 0 _Bool z$r_buff1_thd3; [L758] 0 _Bool z$r_buff1_thd4; [L759] 0 _Bool z$read_delayed; [L760] 0 int *z$read_delayed_var; [L761] 0 int z$w_buff0; [L762] 0 _Bool z$w_buff0_used; [L763] 0 int z$w_buff1; [L764] 0 _Bool z$w_buff1_used; [L765] 0 _Bool weak$$choice0; [L766] 0 _Bool weak$$choice2; [L920] 0 pthread_t t629; [L921] FCALL, FORK 0 pthread_create(&t629, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L922] 0 pthread_t t630; [L923] FCALL, FORK 0 pthread_create(&t630, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L924] 0 pthread_t t631; [L925] FCALL, FORK 0 pthread_create(&t631, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L926] 0 pthread_t t632; [L927] FCALL, FORK 0 pthread_create(&t632, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L861] 4 z$w_buff1 = z$w_buff0 [L862] 4 z$w_buff0 = 2 [L863] 4 z$w_buff1_used = z$w_buff0_used [L864] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L866] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L867] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L868] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L869] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L870] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L871] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L874] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L875] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L876] 4 z$flush_delayed = weak$$choice2 [L877] 4 z$mem_tmp = z [L878] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L878] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1 [L878] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L878] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L879] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L879] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L880] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L880] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L881] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L881] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L882] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L882] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L883] EXPR 4 weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L883] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L884] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L884] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L885] 4 __unbuffered_p3_EAX = z [L886] EXPR 4 z$flush_delayed ? z$mem_tmp : z [L886] 4 z = z$flush_delayed ? z$mem_tmp : z [L887] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L890] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L776] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L776] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L776] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L777] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L777] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L778] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L778] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L779] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L779] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L780] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L780] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L790] 2 x$w_buff1 = x$w_buff0 [L791] 2 x$w_buff0 = 2 [L792] 2 x$w_buff1_used = x$w_buff0_used [L793] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L795] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L796] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L797] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L798] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L799] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L800] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L803] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 2 x$flush_delayed = weak$$choice2 [L806] 2 x$mem_tmp = x [L807] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L807] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1 [L807] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L807] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L808] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L808] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L809] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L809] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L810] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L810] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L811] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L811] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L812] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L812] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L813] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L813] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L814] 2 __unbuffered_p1_EAX = x [L815] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L815] 2 x = x$flush_delayed ? x$mem_tmp : x [L816] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L822] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L823] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L823] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L824] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L824] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L825] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L825] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L826] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L826] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L836] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L839] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L842] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L842] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L842] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L842] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L843] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L843] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L844] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L844] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L845] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L845] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L846] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L846] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L847] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L847] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L847] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L847] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L848] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L848] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L849] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L849] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L850] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L850] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L851] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L851] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L783] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 1 return 0; [L829] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 2 return 0; [L854] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 3 return 0; [L893] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L893] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L893] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L893] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L894] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L894] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L895] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L895] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L896] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L896] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L897] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L897] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L898] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L898] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L899] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L899] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L900] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L900] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L901] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L901] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L902] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L902] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L905] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L907] 4 return 0; [L929] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L933] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L933] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L933] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L933] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L934] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L934] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L935] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L935] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L936] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L936] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L937] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L937] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L938] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L938] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L938] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L938] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L939] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L939] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L940] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L940] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L941] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L941] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L942] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L942] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L945] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L946] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L947] 0 z$flush_delayed = weak$$choice2 [L948] 0 z$mem_tmp = z [L949] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L949] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L950] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L950] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L951] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L951] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L952] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L952] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L953] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L953] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L954] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L954] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L955] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L955] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L956] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L957] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L958] 0 x$flush_delayed = weak$$choice2 [L959] 0 x$mem_tmp = x [L960] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L960] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L961] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L961] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L962] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L962] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L963] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L963] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L964] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L964] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L965] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L965] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L966] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L966] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L967] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L968] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L968] 0 z = z$flush_delayed ? z$mem_tmp : z [L969] 0 z$flush_delayed = (_Bool)0 [L970] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L970] 0 x = x$flush_delayed ? x$mem_tmp : x [L971] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=64, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 137 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.8ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 106328.3ms, OverallIterations: 12, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 2563.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 22645.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 56 SDtfs, 38 SDslu, 51 SDs, 0 SdLazy, 296 SolverSat, 72 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 690.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 770.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=234occurred in iteration=7, InterpolantAutomatonStates: 53, 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: 78.3ms SsaConstructionTime, 930.0ms SatisfiabilityAnalysisTime, 1254.3ms InterpolantComputationTime, 266 NumberOfCodeBlocks, 266 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 228 ConstructedInterpolants, 0 QuantifiedInterpolants, 839 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...