/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-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix015_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-10 12:06:06,293 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-10 12:06:06,294 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-10 12:06:06,320 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-10 12:06:06,320 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-10 12:06:06,321 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-10 12:06:06,322 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-10 12:06:06,324 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-10 12:06:06,325 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-10 12:06:06,326 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-10 12:06:06,327 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-10 12:06:06,327 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-10 12:06:06,328 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-10 12:06:06,329 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-10 12:06:06,329 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-10 12:06:06,330 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-10 12:06:06,331 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-10 12:06:06,332 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-10 12:06:06,333 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-10 12:06:06,334 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-10 12:06:06,340 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-10 12:06:06,345 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-10 12:06:06,346 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-10 12:06:06,347 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-10 12:06:06,348 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-10 12:06:06,349 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-10 12:06:06,349 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-10 12:06:06,349 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-10 12:06:06,350 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-10 12:06:06,350 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-10 12:06:06,351 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-10 12:06:06,351 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-10 12:06:06,352 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-10 12:06:06,352 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-10 12:06:06,353 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-10 12:06:06,353 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-10 12:06:06,354 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-10 12:06:06,354 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-10 12:06:06,354 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-10 12:06:06,355 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-10 12:06:06,355 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-10 12:06:06,365 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-NoLbe.epf [2021-06-10 12:06:06,399 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-10 12:06:06,399 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-10 12:06:06,402 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-10 12:06:06,402 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-10 12:06:06,402 INFO L138 SettingsManager]: * Use SBE=true [2021-06-10 12:06:06,402 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-10 12:06:06,402 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-10 12:06:06,403 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-10 12:06:06,403 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-10 12:06:06,403 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-10 12:06:06,403 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-10 12:06:06,404 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-10 12:06:06,404 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-10 12:06:06,404 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-10 12:06:06,404 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-10 12:06:06,404 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-10 12:06:06,404 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-10 12:06:06,404 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-10 12:06:06,404 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-10 12:06:06,405 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-10 12:06:06,405 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-10 12:06:06,405 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-10 12:06:06,405 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-10 12:06:06,405 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-10 12:06:06,405 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-10 12:06:06,405 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-10 12:06:06,406 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-10 12:06:06,406 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-10 12:06:06,406 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-10 12:06:06,406 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-06-10 12:06:06,716 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-10 12:06:06,733 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-10 12:06:06,735 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-10 12:06:06,736 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-10 12:06:06,737 INFO L275 PluginConnector]: CDTParser initialized [2021-06-10 12:06:06,738 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix015_power.opt.i [2021-06-10 12:06:06,792 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bca0a66a/79e6711e8ab54b6281965ded3cd952cb/FLAG0068f4a3c [2021-06-10 12:06:07,282 INFO L306 CDTParser]: Found 1 translation units. [2021-06-10 12:06:07,283 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix015_power.opt.i [2021-06-10 12:06:07,303 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bca0a66a/79e6711e8ab54b6281965ded3cd952cb/FLAG0068f4a3c [2021-06-10 12:06:07,812 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bca0a66a/79e6711e8ab54b6281965ded3cd952cb [2021-06-10 12:06:07,814 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-10 12:06:07,815 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-10 12:06:07,818 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-10 12:06:07,818 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-10 12:06:07,821 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-10 12:06:07,822 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.06 12:06:07" (1/1) ... [2021-06-10 12:06:07,822 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dead921 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:06:07, skipping insertion in model container [2021-06-10 12:06:07,823 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.06 12:06:07" (1/1) ... [2021-06-10 12:06:07,829 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-10 12:06:07,872 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-10 12:06:07,995 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/mix015_power.opt.i[950,963] [2021-06-10 12:06:08,186 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-10 12:06:08,193 INFO L203 MainTranslator]: Completed pre-run [2021-06-10 12:06:08,203 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/mix015_power.opt.i[950,963] [2021-06-10 12:06:08,267 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-10 12:06:08,334 INFO L208 MainTranslator]: Completed translation [2021-06-10 12:06:08,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:06:08 WrapperNode [2021-06-10 12:06:08,335 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-10 12:06:08,336 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-10 12:06:08,336 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-10 12:06:08,336 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-10 12:06:08,342 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:06:08" (1/1) ... [2021-06-10 12:06:08,371 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:06:08" (1/1) ... [2021-06-10 12:06:08,401 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-10 12:06:08,402 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-10 12:06:08,402 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-10 12:06:08,402 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-10 12:06:08,409 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:06:08" (1/1) ... [2021-06-10 12:06:08,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:06:08" (1/1) ... [2021-06-10 12:06:08,413 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:06:08" (1/1) ... [2021-06-10 12:06:08,414 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:06:08" (1/1) ... [2021-06-10 12:06:08,422 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:06:08" (1/1) ... [2021-06-10 12:06:08,426 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:06:08" (1/1) ... [2021-06-10 12:06:08,429 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:06:08" (1/1) ... [2021-06-10 12:06:08,432 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-10 12:06:08,433 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-10 12:06:08,433 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-10 12:06:08,434 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-10 12:06:08,434 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:06:08" (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-06-10 12:06:08,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-10 12:06:08,509 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-10 12:06:08,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-10 12:06:08,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-10 12:06:08,510 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-10 12:06:08,511 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-10 12:06:08,511 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-10 12:06:08,513 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-10 12:06:08,513 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-10 12:06:08,513 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-10 12:06:08,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-10 12:06:08,513 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-10 12:06:08,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-10 12:06:08,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-10 12:06:08,515 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-10 12:06:10,545 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-10 12:06:10,545 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-10 12:06:10,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.06 12:06:10 BoogieIcfgContainer [2021-06-10 12:06:10,548 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-10 12:06:10,549 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-10 12:06:10,549 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-10 12:06:10,552 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-10 12:06:10,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.06 12:06:07" (1/3) ... [2021-06-10 12:06:10,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2812f1ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.06 12:06:10, skipping insertion in model container [2021-06-10 12:06:10,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:06:08" (2/3) ... [2021-06-10 12:06:10,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2812f1ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.06 12:06:10, skipping insertion in model container [2021-06-10 12:06:10,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.06 12:06:10" (3/3) ... [2021-06-10 12:06:10,555 INFO L111 eAbstractionObserver]: Analyzing ICFG mix015_power.opt.i [2021-06-10 12:06:10,561 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-10 12:06:10,565 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-06-10 12:06:10,565 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-10 12:06:10,611 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,612 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,612 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,612 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,612 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,613 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,613 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,613 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,613 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,613 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,613 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,614 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,614 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,614 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,614 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,614 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,614 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,615 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,615 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,615 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,615 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,615 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,615 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,616 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,616 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,616 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,617 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,617 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,617 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,617 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,617 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,617 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,617 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,617 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,618 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,618 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,618 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,618 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,619 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,619 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,619 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,619 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,619 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,619 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,619 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,620 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,620 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,620 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,620 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,620 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,620 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,620 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,621 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,621 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,621 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,621 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,621 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,621 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,623 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,623 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,624 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,624 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,624 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,624 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,624 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,624 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,625 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,626 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,626 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,626 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,626 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,627 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,627 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,627 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,627 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,627 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,627 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,628 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,628 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,628 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,628 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,628 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,628 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,629 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,629 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,629 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,629 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,629 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,629 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,630 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,630 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,630 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,630 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,630 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,630 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,630 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,634 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,635 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,635 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,636 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,639 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,640 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,640 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,641 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,646 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,647 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,647 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,647 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,647 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,647 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,648 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,648 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,648 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,649 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,649 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,651 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,651 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,651 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,652 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,652 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,652 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,652 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,652 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,652 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,652 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,652 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,652 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,653 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,653 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,653 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,653 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,653 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,653 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,653 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,653 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,653 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,653 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,654 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,654 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,654 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,654 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,654 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,654 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,654 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,654 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,654 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,655 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,655 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,655 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,655 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,655 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,655 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,655 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,655 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,659 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,659 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,659 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,659 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,660 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,660 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,660 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,660 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,660 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,660 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,660 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,660 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,660 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,660 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,661 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,661 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,661 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,661 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,661 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,661 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,661 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,661 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,661 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,662 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,662 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,662 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,662 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,662 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,662 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,662 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,662 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,662 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,662 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,663 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,663 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,663 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,663 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,663 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,665 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,665 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,665 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,665 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,665 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,665 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,666 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,666 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,666 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,666 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,666 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,666 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,667 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,667 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,667 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,667 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,667 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,667 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,669 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,670 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,670 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,670 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,670 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,670 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,671 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,671 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,671 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,680 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,680 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,680 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,680 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,680 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,681 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,681 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,681 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,682 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,682 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,682 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,682 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,682 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,682 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,682 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,683 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,683 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,683 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,683 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,683 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,683 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,683 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,683 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,684 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,684 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,684 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,690 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,690 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,690 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,690 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,692 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,692 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,692 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,693 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,693 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,693 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,693 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,693 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,694 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,694 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,694 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,694 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,694 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,694 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,694 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,694 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,695 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,695 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,695 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,695 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,695 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,695 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,695 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,695 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:06:10,697 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 12:06:10,713 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-06-10 12:06:10,735 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 12:06:10,735 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 12:06:10,735 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 12:06:10,735 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 12:06:10,736 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 12:06:10,736 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 12:06:10,736 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 12:06:10,736 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 12:06:10,746 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 111 places, 103 transitions, 221 flow [2021-06-10 12:06:10,781 INFO L129 PetriNetUnfolder]: 2/100 cut-off events. [2021-06-10 12:06:10,781 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 12:06:10,785 INFO L84 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 100 events. 2/100 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-06-10 12:06:10,785 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 103 transitions, 221 flow [2021-06-10 12:06:10,790 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 100 transitions, 209 flow [2021-06-10 12:06:10,803 INFO L129 PetriNetUnfolder]: 0/68 cut-off events. [2021-06-10 12:06:10,803 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 12:06:10,804 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:06:10,804 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 12:06:10,805 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:06:10,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:06:10,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1088448900, now seen corresponding path program 1 times [2021-06-10 12:06:10,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:06:10,817 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807998592] [2021-06-10 12:06:10,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:06:10,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:06:11,055 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:06:11,056 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:06:11,057 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:06:11,057 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:06:11,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 12:06:11,069 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807998592] [2021-06-10 12:06:11,069 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:06:11,069 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-10 12:06:11,070 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35487811] [2021-06-10 12:06:11,079 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 12:06:11,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:06:11,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 12:06:11,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 12:06:11,092 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 103 [2021-06-10 12:06:11,096 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 100 transitions, 209 flow. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:06:11,096 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:06:11,096 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 103 [2021-06-10 12:06:11,097 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:06:11,191 INFO L129 PetriNetUnfolder]: 13/166 cut-off events. [2021-06-10 12:06:11,192 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 12:06:11,194 INFO L84 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 166 events. 13/166 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 407 event pairs, 5 based on Foata normal form. 6/162 useless extension candidates. Maximal degree in co-relation 156. Up to 25 conditions per place. [2021-06-10 12:06:11,196 INFO L132 encePairwiseOnDemand]: 98/103 looper letters, 6 selfloop transitions, 2 changer transitions 0/98 dead transitions. [2021-06-10 12:06:11,197 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 98 transitions, 221 flow [2021-06-10 12:06:11,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 12:06:11,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 12:06:11,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 292 transitions. [2021-06-10 12:06:11,213 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9449838187702265 [2021-06-10 12:06:11,214 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 292 transitions. [2021-06-10 12:06:11,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 292 transitions. [2021-06-10 12:06:11,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:06:11,219 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 292 transitions. [2021-06-10 12:06:11,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:06:11,233 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:06:11,234 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:06:11,235 INFO L185 Difference]: Start difference. First operand has 108 places, 100 transitions, 209 flow. Second operand 3 states and 292 transitions. [2021-06-10 12:06:11,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 98 transitions, 221 flow [2021-06-10 12:06:11,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 98 transitions, 218 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-06-10 12:06:11,242 INFO L241 Difference]: Finished difference. Result has 105 places, 96 transitions, 202 flow [2021-06-10 12:06:11,244 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=202, PETRI_PLACES=105, PETRI_TRANSITIONS=96} [2021-06-10 12:06:11,245 INFO L343 CegarLoopForPetriNet]: 108 programPoint places, -3 predicate places. [2021-06-10 12:06:11,245 INFO L480 AbstractCegarLoop]: Abstraction has has 105 places, 96 transitions, 202 flow [2021-06-10 12:06:11,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:06:11,245 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:06:11,245 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 12:06:11,246 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-10 12:06:11,246 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:06:11,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:06:11,246 INFO L82 PathProgramCache]: Analyzing trace with hash -751706170, now seen corresponding path program 1 times [2021-06-10 12:06:11,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:06:11,247 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966990667] [2021-06-10 12:06:11,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:06:11,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:06:11,420 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:06:11,421 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:06:11,422 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:06:11,422 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:06:11,433 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 12:06:11,435 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 12:06:11,456 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:06:11,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:06:11,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:06:11,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:06:11,475 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:06:11,475 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:06:11,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 12:06:11,476 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966990667] [2021-06-10 12:06:11,477 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:06:11,477 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-10 12:06:11,477 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662115793] [2021-06-10 12:06:11,479 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-10 12:06:11,479 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:06:11,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-10 12:06:11,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-10 12:06:11,483 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 103 [2021-06-10 12:06:11,484 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 96 transitions, 202 flow. Second operand has 6 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:06:11,484 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:06:11,484 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 103 [2021-06-10 12:06:11,484 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:06:11,614 INFO L129 PetriNetUnfolder]: 4/132 cut-off events. [2021-06-10 12:06:11,614 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 12:06:11,615 INFO L84 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 132 events. 4/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 204 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 119. Up to 8 conditions per place. [2021-06-10 12:06:11,616 INFO L132 encePairwiseOnDemand]: 97/103 looper letters, 6 selfloop transitions, 2 changer transitions 23/108 dead transitions. [2021-06-10 12:06:11,616 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 108 transitions, 268 flow [2021-06-10 12:06:11,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-10 12:06:11,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-10 12:06:11,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 842 transitions. [2021-06-10 12:06:11,619 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9083063646170443 [2021-06-10 12:06:11,619 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 842 transitions. [2021-06-10 12:06:11,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 842 transitions. [2021-06-10 12:06:11,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:06:11,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 842 transitions. [2021-06-10 12:06:11,622 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 93.55555555555556) internal successors, (842), 9 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:06:11,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 103.0) internal successors, (1030), 10 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:06:11,626 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 103.0) internal successors, (1030), 10 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:06:11,627 INFO L185 Difference]: Start difference. First operand has 105 places, 96 transitions, 202 flow. Second operand 9 states and 842 transitions. [2021-06-10 12:06:11,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 108 transitions, 268 flow [2021-06-10 12:06:11,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 108 transitions, 264 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-10 12:06:11,630 INFO L241 Difference]: Finished difference. Result has 118 places, 85 transitions, 196 flow [2021-06-10 12:06:11,630 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=196, PETRI_PLACES=118, PETRI_TRANSITIONS=85} [2021-06-10 12:06:11,631 INFO L343 CegarLoopForPetriNet]: 108 programPoint places, 10 predicate places. [2021-06-10 12:06:11,631 INFO L480 AbstractCegarLoop]: Abstraction has has 118 places, 85 transitions, 196 flow [2021-06-10 12:06:11,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:06:11,632 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:06:11,632 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 12:06:11,632 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-10 12:06:11,632 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:06:11,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:06:11,633 INFO L82 PathProgramCache]: Analyzing trace with hash 587778504, now seen corresponding path program 1 times [2021-06-10 12:06:11,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:06:11,633 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689516468] [2021-06-10 12:06:11,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:06:11,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:06:11,756 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:06:11,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:06:11,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:06:11,759 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:06:11,763 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 12:06:11,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 12:06:11,782 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:06:11,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:06:11,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:06:11,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:06:11,802 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:06:11,802 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:06:11,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 12:06:11,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689516468] [2021-06-10 12:06:11,803 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:06:11,804 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-10 12:06:11,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187287091] [2021-06-10 12:06:11,804 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-10 12:06:11,805 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:06:11,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-10 12:06:11,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-10 12:06:11,808 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 103 [2021-06-10 12:06:11,808 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 85 transitions, 196 flow. Second operand has 6 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:06:11,808 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:06:11,809 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 103 [2021-06-10 12:06:11,809 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:06:11,937 INFO L129 PetriNetUnfolder]: 3/101 cut-off events. [2021-06-10 12:06:11,937 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2021-06-10 12:06:11,937 INFO L84 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 101 events. 3/101 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 113 event pairs, 0 based on Foata normal form. 2/103 useless extension candidates. Maximal degree in co-relation 140. Up to 7 conditions per place. [2021-06-10 12:06:11,938 INFO L132 encePairwiseOnDemand]: 97/103 looper letters, 6 selfloop transitions, 2 changer transitions 10/95 dead transitions. [2021-06-10 12:06:11,938 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 95 transitions, 270 flow [2021-06-10 12:06:11,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-10 12:06:11,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-10 12:06:11,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 839 transitions. [2021-06-10 12:06:11,941 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9050701186623517 [2021-06-10 12:06:11,941 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 839 transitions. [2021-06-10 12:06:11,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 839 transitions. [2021-06-10 12:06:11,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:06:11,941 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 839 transitions. [2021-06-10 12:06:11,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 93.22222222222223) internal successors, (839), 9 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:06:11,945 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 103.0) internal successors, (1030), 10 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:06:11,946 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 103.0) internal successors, (1030), 10 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:06:11,946 INFO L185 Difference]: Start difference. First operand has 118 places, 85 transitions, 196 flow. Second operand 9 states and 839 transitions. [2021-06-10 12:06:11,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 95 transitions, 270 flow [2021-06-10 12:06:11,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 95 transitions, 238 flow, removed 14 selfloop flow, removed 8 redundant places. [2021-06-10 12:06:11,952 INFO L241 Difference]: Finished difference. Result has 108 places, 85 transitions, 200 flow [2021-06-10 12:06:11,952 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=200, PETRI_PLACES=108, PETRI_TRANSITIONS=85} [2021-06-10 12:06:11,953 INFO L343 CegarLoopForPetriNet]: 108 programPoint places, 0 predicate places. [2021-06-10 12:06:11,953 INFO L480 AbstractCegarLoop]: Abstraction has has 108 places, 85 transitions, 200 flow [2021-06-10 12:06:11,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:06:11,953 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:06:11,953 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 12:06:11,954 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-10 12:06:11,954 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:06:11,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:06:11,955 INFO L82 PathProgramCache]: Analyzing trace with hash -107094127, now seen corresponding path program 1 times [2021-06-10 12:06:11,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:06:11,955 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862546958] [2021-06-10 12:06:11,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:06:12,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:06:12,064 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:06:12,064 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:06:12,065 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:06:12,065 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:06:12,068 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-06-10 12:06:12,069 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-10 12:06:12,083 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:06:12,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 12:06:12,092 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-06-10 12:06:12,092 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:06:12,100 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:06:12,100 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:06:12,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 12:06:12,101 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862546958] [2021-06-10 12:06:12,101 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:06:12,101 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-10 12:06:12,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159914339] [2021-06-10 12:06:12,102 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-10 12:06:12,102 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:06:12,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-10 12:06:12,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-10 12:06:12,103 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 103 [2021-06-10 12:06:12,104 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 85 transitions, 200 flow. Second operand has 6 states, 6 states have (on average 90.16666666666667) internal successors, (541), 6 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:06:12,104 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:06:12,104 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 103 [2021-06-10 12:06:12,104 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:06:12,270 INFO L129 PetriNetUnfolder]: 91/312 cut-off events. [2021-06-10 12:06:12,270 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 12:06:12,271 INFO L84 FinitePrefix]: Finished finitePrefix Result has 556 conditions, 312 events. 91/312 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1419 event pairs, 2 based on Foata normal form. 8/316 useless extension candidates. Maximal degree in co-relation 517. Up to 81 conditions per place. [2021-06-10 12:06:12,273 INFO L132 encePairwiseOnDemand]: 94/103 looper letters, 10 selfloop transitions, 6 changer transitions 19/110 dead transitions. [2021-06-10 12:06:12,273 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 110 transitions, 320 flow [2021-06-10 12:06:12,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-10 12:06:12,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-10 12:06:12,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 838 transitions. [2021-06-10 12:06:12,275 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9039913700107874 [2021-06-10 12:06:12,275 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 838 transitions. [2021-06-10 12:06:12,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 838 transitions. [2021-06-10 12:06:12,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:06:12,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 838 transitions. [2021-06-10 12:06:12,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 93.11111111111111) internal successors, (838), 9 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:06:12,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 103.0) internal successors, (1030), 10 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:06:12,281 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 103.0) internal successors, (1030), 10 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:06:12,281 INFO L185 Difference]: Start difference. First operand has 108 places, 85 transitions, 200 flow. Second operand 9 states and 838 transitions. [2021-06-10 12:06:12,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 110 transitions, 320 flow [2021-06-10 12:06:12,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 110 transitions, 304 flow, removed 6 selfloop flow, removed 8 redundant places. [2021-06-10 12:06:12,286 INFO L241 Difference]: Finished difference. Result has 108 places, 88 transitions, 240 flow [2021-06-10 12:06:12,286 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=240, PETRI_PLACES=108, PETRI_TRANSITIONS=88} [2021-06-10 12:06:12,287 INFO L343 CegarLoopForPetriNet]: 108 programPoint places, 0 predicate places. [2021-06-10 12:06:12,287 INFO L480 AbstractCegarLoop]: Abstraction has has 108 places, 88 transitions, 240 flow [2021-06-10 12:06:12,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 90.16666666666667) internal successors, (541), 6 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:06:12,287 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:06:12,288 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 12:06:12,288 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-10 12:06:12,288 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:06:12,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:06:12,288 INFO L82 PathProgramCache]: Analyzing trace with hash -961272266, now seen corresponding path program 1 times [2021-06-10 12:06:12,288 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:06:12,289 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547979976] [2021-06-10 12:06:12,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:06:12,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:06:12,407 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:06:12,408 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:06:12,409 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:06:12,409 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:06:12,412 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:06:12,413 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:06:12,418 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-06-10 12:06:12,418 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-10 12:06:12,432 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:06:12,435 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 12:06:12,442 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-06-10 12:06:12,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:06:12,450 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:06:12,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:06:12,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 12:06:12,451 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547979976] [2021-06-10 12:06:12,451 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:06:12,451 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-10 12:06:12,452 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059247442] [2021-06-10 12:06:12,452 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-10 12:06:12,452 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:06:12,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-10 12:06:12,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-10 12:06:12,453 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 103 [2021-06-10 12:06:12,454 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 88 transitions, 240 flow. Second operand has 7 states, 7 states have (on average 90.14285714285714) internal successors, (631), 7 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:06:12,454 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:06:12,454 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 103 [2021-06-10 12:06:12,454 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:06:12,625 INFO L129 PetriNetUnfolder]: 52/221 cut-off events. [2021-06-10 12:06:12,626 INFO L130 PetriNetUnfolder]: For 283/295 co-relation queries the response was YES. [2021-06-10 12:06:12,627 INFO L84 FinitePrefix]: Finished finitePrefix Result has 611 conditions, 221 events. 52/221 cut-off events. For 283/295 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 767 event pairs, 0 based on Foata normal form. 12/231 useless extension candidates. Maximal degree in co-relation 552. Up to 75 conditions per place. [2021-06-10 12:06:12,628 INFO L132 encePairwiseOnDemand]: 94/103 looper letters, 10 selfloop transitions, 9 changer transitions 19/113 dead transitions. [2021-06-10 12:06:12,628 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 113 transitions, 493 flow [2021-06-10 12:06:12,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-10 12:06:12,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-06-10 12:06:12,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 930 transitions. [2021-06-10 12:06:12,630 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9029126213592233 [2021-06-10 12:06:12,630 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 930 transitions. [2021-06-10 12:06:12,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 930 transitions. [2021-06-10 12:06:12,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:06:12,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 930 transitions. [2021-06-10 12:06:12,633 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 93.0) internal successors, (930), 10 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:06:12,635 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 103.0) internal successors, (1133), 11 states have internal predecessors, (1133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:06:12,635 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 103.0) internal successors, (1133), 11 states have internal predecessors, (1133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:06:12,636 INFO L185 Difference]: Start difference. First operand has 108 places, 88 transitions, 240 flow. Second operand 10 states and 930 transitions. [2021-06-10 12:06:12,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 113 transitions, 493 flow [2021-06-10 12:06:12,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 113 transitions, 469 flow, removed 7 selfloop flow, removed 5 redundant places. [2021-06-10 12:06:12,639 INFO L241 Difference]: Finished difference. Result has 114 places, 91 transitions, 308 flow [2021-06-10 12:06:12,640 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=308, PETRI_PLACES=114, PETRI_TRANSITIONS=91} [2021-06-10 12:06:12,640 INFO L343 CegarLoopForPetriNet]: 108 programPoint places, 6 predicate places. [2021-06-10 12:06:12,640 INFO L480 AbstractCegarLoop]: Abstraction has has 114 places, 91 transitions, 308 flow [2021-06-10 12:06:12,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 90.14285714285714) internal successors, (631), 7 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:06:12,640 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:06:12,640 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 12:06:12,641 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-10 12:06:12,641 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:06:12,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:06:12,641 INFO L82 PathProgramCache]: Analyzing trace with hash -39712507, now seen corresponding path program 1 times [2021-06-10 12:06:12,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:06:12,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258964992] [2021-06-10 12:06:12,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:06:12,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:06:12,693 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:06:12,693 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:06:12,694 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:06:12,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:06:12,697 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:06:12,697 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:06:12,701 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 12:06:12,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 12:06:12,719 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:06:12,720 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:06:12,728 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:06:12,729 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:06:12,738 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:06:12,739 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:06:12,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 12:06:12,739 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258964992] [2021-06-10 12:06:12,739 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:06:12,740 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-10 12:06:12,740 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549951687] [2021-06-10 12:06:12,740 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-10 12:06:12,740 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:06:12,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-10 12:06:12,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-10 12:06:12,741 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 103 [2021-06-10 12:06:12,742 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 91 transitions, 308 flow. Second operand has 7 states, 7 states have (on average 90.42857142857143) internal successors, (633), 7 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:06:12,742 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:06:12,742 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 103 [2021-06-10 12:06:12,742 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:06:12,844 INFO L129 PetriNetUnfolder]: 32/261 cut-off events. [2021-06-10 12:06:12,845 INFO L130 PetriNetUnfolder]: For 545/574 co-relation queries the response was YES. [2021-06-10 12:06:12,846 INFO L84 FinitePrefix]: Finished finitePrefix Result has 695 conditions, 261 events. 32/261 cut-off events. For 545/574 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1060 event pairs, 6 based on Foata normal form. 8/267 useless extension candidates. Maximal degree in co-relation 631. Up to 55 conditions per place. [2021-06-10 12:06:12,847 INFO L132 encePairwiseOnDemand]: 97/103 looper letters, 13 selfloop transitions, 2 changer transitions 4/100 dead transitions. [2021-06-10 12:06:12,847 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 100 transitions, 368 flow [2021-06-10 12:06:12,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-10 12:06:12,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-10 12:06:12,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 643 transitions. [2021-06-10 12:06:12,849 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8918169209431346 [2021-06-10 12:06:12,849 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 643 transitions. [2021-06-10 12:06:12,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 643 transitions. [2021-06-10 12:06:12,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:06:12,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 643 transitions. [2021-06-10 12:06:12,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 91.85714285714286) internal successors, (643), 7 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:06:12,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 103.0) internal successors, (824), 8 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-06-10 12:06:12,853 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 103.0) internal successors, (824), 8 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-06-10 12:06:12,853 INFO L185 Difference]: Start difference. First operand has 114 places, 91 transitions, 308 flow. Second operand 7 states and 643 transitions. [2021-06-10 12:06:12,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 100 transitions, 368 flow [2021-06-10 12:06:12,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 100 transitions, 312 flow, removed 20 selfloop flow, removed 9 redundant places. [2021-06-10 12:06:12,857 INFO L241 Difference]: Finished difference. Result has 112 places, 92 transitions, 271 flow [2021-06-10 12:06:12,857 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=271, PETRI_PLACES=112, PETRI_TRANSITIONS=92} [2021-06-10 12:06:12,857 INFO L343 CegarLoopForPetriNet]: 108 programPoint places, 4 predicate places. [2021-06-10 12:06:12,857 INFO L480 AbstractCegarLoop]: Abstraction has has 112 places, 92 transitions, 271 flow [2021-06-10 12:06:12,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 90.42857142857143) internal successors, (633), 7 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:06:12,858 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:06:12,858 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 12:06:12,858 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-10 12:06:12,858 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:06:12,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:06:12,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1712202075, now seen corresponding path program 2 times [2021-06-10 12:06:12,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:06:12,859 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226849308] [2021-06-10 12:06:12,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:06:12,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:06:12,917 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:06:12,918 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:06:12,918 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:06:12,918 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:06:12,921 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:06:12,921 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:06:12,925 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:06:12,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:06:12,930 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-06-10 12:06:12,930 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-10 12:06:12,949 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:06:12,949 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 12:06:12,958 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-06-10 12:06:12,959 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:06:12,970 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:06:12,971 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:06:12,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 12:06:12,971 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226849308] [2021-06-10 12:06:12,971 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:06:12,972 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-10 12:06:12,972 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041320864] [2021-06-10 12:06:12,972 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-10 12:06:12,972 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:06:12,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-10 12:06:12,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-10 12:06:12,973 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 103 [2021-06-10 12:06:12,974 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 92 transitions, 271 flow. Second operand has 8 states, 8 states have (on average 90.125) internal successors, (721), 8 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:06:12,974 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:06:12,974 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 103 [2021-06-10 12:06:12,974 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:06:13,131 INFO L129 PetriNetUnfolder]: 32/195 cut-off events. [2021-06-10 12:06:13,131 INFO L130 PetriNetUnfolder]: For 288/328 co-relation queries the response was YES. [2021-06-10 12:06:13,132 INFO L84 FinitePrefix]: Finished finitePrefix Result has 505 conditions, 195 events. 32/195 cut-off events. For 288/328 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 647 event pairs, 0 based on Foata normal form. 26/219 useless extension candidates. Maximal degree in co-relation 488. Up to 53 conditions per place. [2021-06-10 12:06:13,133 INFO L132 encePairwiseOnDemand]: 94/103 looper letters, 4 selfloop transitions, 12 changer transitions 14/105 dead transitions. [2021-06-10 12:06:13,133 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 105 transitions, 416 flow [2021-06-10 12:06:13,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-10 12:06:13,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-06-10 12:06:13,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1010 transitions. [2021-06-10 12:06:13,135 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8914386584289496 [2021-06-10 12:06:13,135 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1010 transitions. [2021-06-10 12:06:13,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1010 transitions. [2021-06-10 12:06:13,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:06:13,136 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1010 transitions. [2021-06-10 12:06:13,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 91.81818181818181) internal successors, (1010), 11 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:06:13,140 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 103.0) internal successors, (1236), 12 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:06:13,141 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 103.0) internal successors, (1236), 12 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:06:13,141 INFO L185 Difference]: Start difference. First operand has 112 places, 92 transitions, 271 flow. Second operand 11 states and 1010 transitions. [2021-06-10 12:06:13,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 105 transitions, 416 flow [2021-06-10 12:06:13,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 105 transitions, 383 flow, removed 14 selfloop flow, removed 6 redundant places. [2021-06-10 12:06:13,144 INFO L241 Difference]: Finished difference. Result has 119 places, 91 transitions, 290 flow [2021-06-10 12:06:13,144 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=290, PETRI_PLACES=119, PETRI_TRANSITIONS=91} [2021-06-10 12:06:13,144 INFO L343 CegarLoopForPetriNet]: 108 programPoint places, 11 predicate places. [2021-06-10 12:06:13,144 INFO L480 AbstractCegarLoop]: Abstraction has has 119 places, 91 transitions, 290 flow [2021-06-10 12:06:13,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 90.125) internal successors, (721), 8 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:06:13,145 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:06:13,145 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 12:06:13,145 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-10 12:06:13,145 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:06:13,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:06:13,145 INFO L82 PathProgramCache]: Analyzing trace with hash 383315139, now seen corresponding path program 1 times [2021-06-10 12:06:13,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:06:13,146 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727701588] [2021-06-10 12:06:13,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:06:13,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:06:13,250 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:06:13,250 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:06:13,251 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:06:13,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:06:13,256 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:06:13,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 12:06:13,262 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:06:13,262 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-10 12:06:13,270 INFO L142 QuantifierPusher]: treesize reduction 2, result has 91.7 percent of original size [2021-06-10 12:06:13,271 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-06-10 12:06:13,289 INFO L142 QuantifierPusher]: treesize reduction 39, result has 66.9 percent of original size [2021-06-10 12:06:13,292 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 79 [2021-06-10 12:06:13,340 INFO L142 QuantifierPusher]: treesize reduction 8, result has 65.2 percent of original size [2021-06-10 12:06:13,341 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-06-10 12:06:13,353 INFO L142 QuantifierPusher]: treesize reduction 8, result has 50.0 percent of original size [2021-06-10 12:06:13,353 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 12:06:13,361 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 12:06:13,365 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 12:06:13,381 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:06:13,383 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:06:13,403 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:06:13,406 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:06:13,419 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:06:13,420 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:06:13,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 12:06:13,421 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727701588] [2021-06-10 12:06:13,421 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:06:13,421 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-10 12:06:13,421 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363980246] [2021-06-10 12:06:13,421 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-10 12:06:13,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:06:13,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-10 12:06:13,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-06-10 12:06:13,423 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 103 [2021-06-10 12:06:13,424 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 91 transitions, 290 flow. Second operand has 12 states, 12 states have (on average 79.66666666666667) internal successors, (956), 12 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:06:13,424 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:06:13,424 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 103 [2021-06-10 12:06:13,424 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:06:13,704 INFO L129 PetriNetUnfolder]: 20/202 cut-off events. [2021-06-10 12:06:13,704 INFO L130 PetriNetUnfolder]: For 163/170 co-relation queries the response was YES. [2021-06-10 12:06:13,705 INFO L84 FinitePrefix]: Finished finitePrefix Result has 450 conditions, 202 events. 20/202 cut-off events. For 163/170 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 664 event pairs, 0 based on Foata normal form. 1/199 useless extension candidates. Maximal degree in co-relation 414. Up to 37 conditions per place. [2021-06-10 12:06:13,705 INFO L132 encePairwiseOnDemand]: 90/103 looper letters, 16 selfloop transitions, 11 changer transitions 6/104 dead transitions. [2021-06-10 12:06:13,705 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 104 transitions, 384 flow [2021-06-10 12:06:13,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-10 12:06:13,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-06-10 12:06:13,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1126 transitions. [2021-06-10 12:06:13,708 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7808599167822469 [2021-06-10 12:06:13,708 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1126 transitions. [2021-06-10 12:06:13,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1126 transitions. [2021-06-10 12:06:13,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:06:13,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1126 transitions. [2021-06-10 12:06:13,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 80.42857142857143) internal successors, (1126), 14 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:06:13,713 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 103.0) internal successors, (1545), 15 states have internal predecessors, (1545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:06:13,713 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 103.0) internal successors, (1545), 15 states have internal predecessors, (1545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:06:13,713 INFO L185 Difference]: Start difference. First operand has 119 places, 91 transitions, 290 flow. Second operand 14 states and 1126 transitions. [2021-06-10 12:06:13,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 104 transitions, 384 flow [2021-06-10 12:06:13,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 104 transitions, 304 flow, removed 21 selfloop flow, removed 16 redundant places. [2021-06-10 12:06:13,716 INFO L241 Difference]: Finished difference. Result has 119 places, 98 transitions, 278 flow [2021-06-10 12:06:13,716 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=278, PETRI_PLACES=119, PETRI_TRANSITIONS=98} [2021-06-10 12:06:13,716 INFO L343 CegarLoopForPetriNet]: 108 programPoint places, 11 predicate places. [2021-06-10 12:06:13,717 INFO L480 AbstractCegarLoop]: Abstraction has has 119 places, 98 transitions, 278 flow [2021-06-10 12:06:13,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 79.66666666666667) internal successors, (956), 12 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:06:13,717 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:06:13,717 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 12:06:13,717 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-10 12:06:13,717 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:06:13,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:06:13,718 INFO L82 PathProgramCache]: Analyzing trace with hash -674746093, now seen corresponding path program 2 times [2021-06-10 12:06:13,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:06:13,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490944690] [2021-06-10 12:06:13,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:06:13,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:06:13,788 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:06:13,788 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:06:13,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:06:13,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:06:13,795 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-06-10 12:06:13,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-10 12:06:13,806 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 12:06:13,807 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 12:06:13,824 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:06:13,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:06:13,833 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:06:13,834 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:06:13,891 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:06:13,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:06:13,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 12:06:13,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490944690] [2021-06-10 12:06:13,892 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:06:13,892 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-10 12:06:13,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556508309] [2021-06-10 12:06:13,893 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-10 12:06:13,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:06:13,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-10 12:06:13,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-10 12:06:13,894 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 103 [2021-06-10 12:06:13,895 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 98 transitions, 278 flow. Second operand has 7 states, 7 states have (on average 83.57142857142857) internal successors, (585), 7 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:06:13,895 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:06:13,895 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 103 [2021-06-10 12:06:13,895 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:06:14,046 INFO L129 PetriNetUnfolder]: 51/349 cut-off events. [2021-06-10 12:06:14,046 INFO L130 PetriNetUnfolder]: For 38/46 co-relation queries the response was YES. [2021-06-10 12:06:14,048 INFO L84 FinitePrefix]: Finished finitePrefix Result has 606 conditions, 349 events. 51/349 cut-off events. For 38/46 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1807 event pairs, 3 based on Foata normal form. 2/343 useless extension candidates. Maximal degree in co-relation 591. Up to 54 conditions per place. [2021-06-10 12:06:14,048 INFO L132 encePairwiseOnDemand]: 91/103 looper letters, 16 selfloop transitions, 7 changer transitions 16/112 dead transitions. [2021-06-10 12:06:14,048 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 112 transitions, 404 flow [2021-06-10 12:06:14,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-10 12:06:14,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-06-10 12:06:14,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 677 transitions. [2021-06-10 12:06:14,050 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8216019417475728 [2021-06-10 12:06:14,050 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 677 transitions. [2021-06-10 12:06:14,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 677 transitions. [2021-06-10 12:06:14,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:06:14,051 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 677 transitions. [2021-06-10 12:06:14,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 84.625) internal successors, (677), 8 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:06:14,054 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 103.0) internal successors, (927), 9 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:06:14,054 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 103.0) internal successors, (927), 9 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:06:14,054 INFO L185 Difference]: Start difference. First operand has 119 places, 98 transitions, 278 flow. Second operand 8 states and 677 transitions. [2021-06-10 12:06:14,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 112 transitions, 404 flow [2021-06-10 12:06:14,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 112 transitions, 380 flow, removed 8 selfloop flow, removed 8 redundant places. [2021-06-10 12:06:14,057 INFO L241 Difference]: Finished difference. Result has 119 places, 93 transitions, 269 flow [2021-06-10 12:06:14,057 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=269, PETRI_PLACES=119, PETRI_TRANSITIONS=93} [2021-06-10 12:06:14,057 INFO L343 CegarLoopForPetriNet]: 108 programPoint places, 11 predicate places. [2021-06-10 12:06:14,057 INFO L480 AbstractCegarLoop]: Abstraction has has 119 places, 93 transitions, 269 flow [2021-06-10 12:06:14,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 83.57142857142857) internal successors, (585), 7 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:06:14,058 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:06:14,058 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 12:06:14,058 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-10 12:06:14,058 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:06:14,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:06:14,059 INFO L82 PathProgramCache]: Analyzing trace with hash -418652171, now seen corresponding path program 3 times [2021-06-10 12:06:14,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:06:14,059 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547474995] [2021-06-10 12:06:14,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:06:14,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 12:06:14,096 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 12:06:14,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 12:06:14,139 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 12:06:14,188 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 12:06:14,188 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 12:06:14,188 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-10 12:06:14,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.06 12:06:14 BasicIcfg [2021-06-10 12:06:14,364 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-10 12:06:14,365 INFO L168 Benchmark]: Toolchain (without parser) took 6549.21 ms. Allocated memory was 419.4 MB in the beginning and 539.0 MB in the end (delta: 119.5 MB). Free memory was 382.1 MB in the beginning and 392.0 MB in the end (delta: -9.9 MB). Peak memory consumption was 109.7 MB. Max. memory is 16.0 GB. [2021-06-10 12:06:14,365 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 419.4 MB. Free memory was 400.8 MB in the beginning and 400.7 MB in the end (delta: 72.8 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-10 12:06:14,365 INFO L168 Benchmark]: CACSL2BoogieTranslator took 517.37 ms. Allocated memory is still 419.4 MB. Free memory was 382.0 MB in the beginning and 379.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.0 GB. [2021-06-10 12:06:14,366 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.30 ms. Allocated memory is still 419.4 MB. Free memory was 379.4 MB in the beginning and 376.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-10 12:06:14,366 INFO L168 Benchmark]: Boogie Preprocessor took 30.83 ms. Allocated memory is still 419.4 MB. Free memory was 375.9 MB in the beginning and 373.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-10 12:06:14,366 INFO L168 Benchmark]: RCFGBuilder took 2114.56 ms. Allocated memory was 419.4 MB in the beginning and 539.0 MB in the end (delta: 119.5 MB). Free memory was 373.8 MB in the beginning and 442.9 MB in the end (delta: -69.1 MB). Peak memory consumption was 105.0 MB. Max. memory is 16.0 GB. [2021-06-10 12:06:14,366 INFO L168 Benchmark]: TraceAbstraction took 3814.69 ms. Allocated memory is still 539.0 MB. Free memory was 442.9 MB in the beginning and 392.0 MB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 16.0 GB. [2021-06-10 12:06:14,368 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.12 ms. Allocated memory is still 419.4 MB. Free memory was 400.8 MB in the beginning and 400.7 MB in the end (delta: 72.8 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 517.37 ms. Allocated memory is still 419.4 MB. Free memory was 382.0 MB in the beginning and 379.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 65.30 ms. Allocated memory is still 419.4 MB. Free memory was 379.4 MB in the beginning and 376.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 30.83 ms. Allocated memory is still 419.4 MB. Free memory was 375.9 MB in the beginning and 373.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2114.56 ms. Allocated memory was 419.4 MB in the beginning and 539.0 MB in the end (delta: 119.5 MB). Free memory was 373.8 MB in the beginning and 442.9 MB in the end (delta: -69.1 MB). Peak memory consumption was 105.0 MB. Max. memory is 16.0 GB. * TraceAbstraction took 3814.69 ms. Allocated memory is still 539.0 MB. Free memory was 442.9 MB in the beginning and 392.0 MB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L715] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L717] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L719] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L721] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L722] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L723] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L725] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L727] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L729] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L730] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L731] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L732] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L733] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L734] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L735] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L736] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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_buff1_thd0=0] [L737] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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_buff1_thd0=0, z$r_buff1_thd1=0] [L738] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L739] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L740] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L741] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L742] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L743] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L744] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L745] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L746] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L747] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L853] 0 pthread_t t388; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L854] FCALL, FORK 0 pthread_create(&t388, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L855] 0 pthread_t t389; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L856] FCALL, FORK 0 pthread_create(&t389, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L857] 0 pthread_t t390; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L858] FCALL, FORK 0 pthread_create(&t390, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L800] 3 z$w_buff1 = z$w_buff0 [L801] 3 z$w_buff0 = 1 [L802] 3 z$w_buff1_used = z$w_buff0_used [L803] 3 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L805] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 3 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 z$flush_delayed = weak$$choice2 [L815] 3 z$mem_tmp = z [L816] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L816] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1 [L816] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L816] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L817] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L817] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L818] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L818] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L819] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L819] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L820] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L821] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L822] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 __unbuffered_p2_EAX = z [L824] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L824] 3 z = z$flush_delayed ? z$mem_tmp : z [L825] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 z$flush_delayed = weak$$choice2 [L778] 2 z$mem_tmp = z [L779] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L779] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L780] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L780] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L781] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L781] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L782] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L782] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L783] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L784] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L785] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EAX = z [L787] EXPR 2 z$flush_delayed ? z$mem_tmp : z [L787] 2 z = z$flush_delayed ? z$mem_tmp : z [L788] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=49, weak$$choice2=255, x=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=49, weak$$choice2=255, x=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=49, weak$$choice2=255, x=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L831] 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) [L831] 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) [L832] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L832] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L833] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L833] 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 [L834] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L834] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L835] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L835] 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 [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=49, weak$$choice2=255, x=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=49, weak$$choice2=255, x=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=49, weak$$choice2=255, x=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L864] 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) [L864] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L864] 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) [L864] 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) [L865] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L865] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L866] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L866] 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 [L867] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L867] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L868] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L868] 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 [L871] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=49, weak$$choice2=255, x=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=49, weak$$choice2=255, x=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=49, weak$$choice2=255, x=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 102 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 13.0ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 3456.8ms, OverallIterations: 10, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1574.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 54.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 87 SDtfs, 150 SDslu, 286 SDs, 0 SdLazy, 383 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 330.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 105 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1002.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=308occurred in iteration=5, InterpolantAutomatonStates: 80, 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: 41.2ms SsaConstructionTime, 429.8ms SatisfiabilityAnalysisTime, 1082.3ms InterpolantComputationTime, 711 NumberOfCodeBlocks, 711 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 623 ConstructedInterpolants, 0 QuantifiedInterpolants, 2369 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...