/usr/bin/java -Xmx8000000000 -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-OGIterative-Hitting.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix001_pso.opt.i
--------------------------------------------------------------------------------
This is Ultimate 0.2.1-2cf4d3f9dd5fed411db405f577e28237a543b59a-2cf4d3f
[2021-08-13 10:01:39,505 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2021-08-13 10:01:39,507 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2021-08-13 10:01:39,531 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-08-13 10:01:39,532 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-08-13 10:01:39,533 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-08-13 10:01:39,534 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-08-13 10:01:39,536 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2021-08-13 10:01:39,537 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-08-13 10:01:39,538 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-08-13 10:01:39,539 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2021-08-13 10:01:39,540 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-08-13 10:01:39,540 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-08-13 10:01:39,541 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-08-13 10:01:39,542 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-08-13 10:01:39,543 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-08-13 10:01:39,543 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-08-13 10:01:39,544 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-08-13 10:01:39,545 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-08-13 10:01:39,547 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2021-08-13 10:01:39,548 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-08-13 10:01:39,549 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-08-13 10:01:39,550 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2021-08-13 10:01:39,551 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-08-13 10:01:39,553 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-08-13 10:01:39,554 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-08-13 10:01:39,554 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-08-13 10:01:39,555 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-08-13 10:01:39,555 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-08-13 10:01:39,556 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-08-13 10:01:39,558 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-08-13 10:01:39,558 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-08-13 10:01:39,559 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-08-13 10:01:39,560 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2021-08-13 10:01:39,561 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-08-13 10:01:39,561 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2021-08-13 10:01:39,561 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-08-13 10:01:39,562 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-08-13 10:01:39,562 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2021-08-13 10:01:39,563 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2021-08-13 10:01:39,563 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2021-08-13 10:01:39,569 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-OGIterative-Hitting.epf
[2021-08-13 10:01:39,605 INFO L113 SettingsManager]: Loading preferences was successful
[2021-08-13 10:01:39,605 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2021-08-13 10:01:39,608 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-08-13 10:01:39,609 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2021-08-13 10:01:39,609 INFO L138 SettingsManager]: * Use SBE=true
[2021-08-13 10:01:39,609 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-08-13 10:01:39,609 INFO L138 SettingsManager]: * sizeof long=4
[2021-08-13 10:01:39,609 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2021-08-13 10:01:39,610 INFO L138 SettingsManager]: * sizeof POINTER=4
[2021-08-13 10:01:39,610 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2021-08-13 10:01:39,610 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2021-08-13 10:01:39,611 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2021-08-13 10:01:39,611 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2021-08-13 10:01:39,611 INFO L138 SettingsManager]: * sizeof long double=12
[2021-08-13 10:01:39,611 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2021-08-13 10:01:39,611 INFO L138 SettingsManager]: * Use constant arrays=true
[2021-08-13 10:01:39,611 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2021-08-13 10:01:39,612 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-08-13 10:01:39,612 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2021-08-13 10:01:39,612 INFO L138 SettingsManager]: * To the following directory=./dump/
[2021-08-13 10:01:39,612 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2021-08-13 10:01:39,612 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-08-13 10:01:39,612 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-08-13 10:01:39,613 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2021-08-13 10:01:39,613 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2021-08-13 10:01:39,613 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2021-08-13 10:01:39,613 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2021-08-13 10:01:39,613 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF
[2021-08-13 10:01:39,613 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2021-08-13 10:01:39,614 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2021-08-13 10:01:39,614 INFO L138 SettingsManager]: * Compute cosets for OwickiGries annotation iteratively=true
[2021-08-13 10:01:39,614 INFO L138 SettingsManager]: * Use hitting sets in computation of OwickiGries annotation=true
[2021-08-13 10:01:39,614 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-08-13 10:01:39,981 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2021-08-13 10:01:39,999 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-08-13 10:01:40,001 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-08-13 10:01:40,003 INFO L271 PluginConnector]: Initializing CDTParser...
[2021-08-13 10:01:40,003 INFO L275 PluginConnector]: CDTParser initialized
[2021-08-13 10:01:40,004 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix001_pso.opt.i
[2021-08-13 10:01:40,087 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd9eca0f7/af9f6a1455a6417384d06ab393138d68/FLAG91dc03ab7
[2021-08-13 10:01:40,608 INFO L306 CDTParser]: Found 1 translation units.
[2021-08-13 10:01:40,609 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix001_pso.opt.i
[2021-08-13 10:01:40,634 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd9eca0f7/af9f6a1455a6417384d06ab393138d68/FLAG91dc03ab7
[2021-08-13 10:01:40,890 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd9eca0f7/af9f6a1455a6417384d06ab393138d68
[2021-08-13 10:01:40,894 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-08-13 10:01:40,896 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements.
[2021-08-13 10:01:40,898 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-08-13 10:01:40,899 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-08-13 10:01:40,902 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2021-08-13 10:01:40,903 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.08 10:01:40" (1/1) ...
[2021-08-13 10:01:40,905 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37c64aac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 10:01:40, skipping insertion in model container
[2021-08-13 10:01:40,905 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.08 10:01:40" (1/1) ...
[2021-08-13 10:01:40,912 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2021-08-13 10:01:40,965 INFO L178 MainTranslator]: Built tables and reachable declarations
[2021-08-13 10:01:41,098 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix001_pso.opt.i[948,961]
[2021-08-13 10:01:41,337 INFO L206 PostProcessor]: Analyzing one entry point: main
[2021-08-13 10:01:41,353 INFO L203 MainTranslator]: Completed pre-run
[2021-08-13 10:01:41,366 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix001_pso.opt.i[948,961]
[2021-08-13 10:01:41,439 INFO L206 PostProcessor]: Analyzing one entry point: main
[2021-08-13 10:01:41,517 INFO L208 MainTranslator]: Completed translation
[2021-08-13 10:01:41,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 10:01:41 WrapperNode
[2021-08-13 10:01:41,518 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-08-13 10:01:41,519 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-08-13 10:01:41,519 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-08-13 10:01:41,519 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2021-08-13 10:01:41,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 10:01:41" (1/1) ...
[2021-08-13 10:01:41,563 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 10:01:41" (1/1) ...
[2021-08-13 10:01:41,603 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-08-13 10:01:41,604 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-08-13 10:01:41,605 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2021-08-13 10:01:41,605 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2021-08-13 10:01:41,614 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 10:01:41" (1/1) ...
[2021-08-13 10:01:41,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 10:01:41" (1/1) ...
[2021-08-13 10:01:41,631 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 10:01:41" (1/1) ...
[2021-08-13 10:01:41,631 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 10:01:41" (1/1) ...
[2021-08-13 10:01:41,643 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 10:01:41" (1/1) ...
[2021-08-13 10:01:41,646 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 10:01:41" (1/1) ...
[2021-08-13 10:01:41,664 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 10:01:41" (1/1) ...
[2021-08-13 10:01:41,668 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-08-13 10:01:41,669 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-08-13 10:01:41,669 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2021-08-13 10:01:41,670 INFO L275 PluginConnector]: RCFGBuilder initialized
[2021-08-13 10:01:41,670 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 10:01:41" (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-08-13 10:01:41,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2021-08-13 10:01:41,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2021-08-13 10:01:41,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-08-13 10:01:41,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2021-08-13 10:01:41,756 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2021-08-13 10:01:41,757 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2021-08-13 10:01:41,757 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2021-08-13 10:01:41,757 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2021-08-13 10:01:41,757 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2021-08-13 10:01:41,757 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2021-08-13 10:01:41,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2021-08-13 10:01:41,757 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2021-08-13 10:01:41,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-08-13 10:01:41,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-08-13 10:01:41,759 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2021-08-13 10:01:43,710 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-08-13 10:01:43,711 INFO L299 CfgBuilder]: Removed 10 assume(true) statements.
[2021-08-13 10:01:43,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.08 10:01:43 BoogieIcfgContainer
[2021-08-13 10:01:43,712 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-08-13 10:01:43,714 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2021-08-13 10:01:43,714 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2021-08-13 10:01:43,716 INFO L275 PluginConnector]: TraceAbstraction initialized
[2021-08-13 10:01:43,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.08 10:01:40" (1/3) ...
[2021-08-13 10:01:43,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f667f16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.08 10:01:43, skipping insertion in model container
[2021-08-13 10:01:43,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 10:01:41" (2/3) ...
[2021-08-13 10:01:43,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f667f16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.08 10:01:43, skipping insertion in model container
[2021-08-13 10:01:43,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.08 10:01:43" (3/3) ...
[2021-08-13 10:01:43,719 INFO L111 eAbstractionObserver]: Analyzing ICFG mix001_pso.opt.i
[2021-08-13 10:01:43,724 INFO L206 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2021-08-13 10:01:43,725 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2021-08-13 10:01:43,725 INFO L445 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2021-08-13 10:01:43,760 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,761 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,761 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,761 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,761 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,761 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,761 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,762 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,762 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,762 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,762 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,762 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,762 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,763 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,763 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,763 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,763 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,763 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,763 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,763 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,764 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,764 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,764 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,764 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,764 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,764 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,764 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,765 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,765 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,765 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,765 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,765 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,765 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,765 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,765 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,766 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,766 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,766 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,766 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,766 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,766 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,766 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,766 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,766 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,766 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,767 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,767 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,767 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,767 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,767 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,767 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,767 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,767 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,767 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,767 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,768 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,768 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,768 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,791 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,791 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,794 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,794 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,794 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,794 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,794 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,794 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,794 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,794 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,794 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,795 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,795 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,795 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,795 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,795 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,795 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,795 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,795 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,795 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,798 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,799 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,799 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,799 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,799 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,799 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,799 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,799 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,800 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,800 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,800 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,800 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,800 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,800 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,801 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,801 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,801 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,801 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,801 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,801 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,801 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,801 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,801 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,801 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,802 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,802 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,802 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,802 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,802 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,802 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,802 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,802 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,803 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,803 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,803 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,803 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,803 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,803 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,803 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,803 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,803 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,803 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,804 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,804 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,804 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,804 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,804 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,804 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,804 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,804 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,804 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,805 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,805 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,805 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,806 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,806 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,806 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,807 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,807 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,807 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,807 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,807 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,807 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,807 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,807 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,809 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,809 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,809 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,809 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,809 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,809 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,809 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,809 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,809 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,810 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,810 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,810 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,810 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,810 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,810 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,810 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,810 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,810 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,812 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,812 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,812 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,812 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,816 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,816 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,816 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,816 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,818 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,821 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,823 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,826 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,827 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,827 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,827 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,827 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,827 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,827 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,827 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,827 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,828 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,828 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,828 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,828 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,828 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,828 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,828 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,830 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,830 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,830 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,830 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,830 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,830 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,832 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,832 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,832 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,832 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-13 10:01:43,833 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2021-08-13 10:01:43,853 INFO L255 AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2021-08-13 10:01:43,869 INFO L378 AbstractCegarLoop]: Interprodecural is true
[2021-08-13 10:01:43,870 INFO L379 AbstractCegarLoop]: Hoare is false
[2021-08-13 10:01:43,870 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-08-13 10:01:43,870 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-08-13 10:01:43,870 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-08-13 10:01:43,870 INFO L383 AbstractCegarLoop]: Difference is false
[2021-08-13 10:01:43,870 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-08-13 10:01:43,870 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2021-08-13 10:01:43,880 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 239 flow
[2021-08-13 10:01:43,914 INFO L129 PetriNetUnfolder]: 2/109 cut-off events.
[2021-08-13 10:01:43,915 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-08-13 10:01:43,918 INFO L84 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place.
[2021-08-13 10:01:43,918 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 112 transitions, 239 flow
[2021-08-13 10:01:43,922 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 109 transitions, 227 flow
[2021-08-13 10:01:43,936 INFO L129 PetriNetUnfolder]: 0/75 cut-off events.
[2021-08-13 10:01:43,936 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-08-13 10:01:43,936 INFO L258 CegarLoopForPetriNet]: Found error trace
[2021-08-13 10:01:43,937 INFO L266 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]
[2021-08-13 10:01:43,937 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-08-13 10:01:43,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-08-13 10:01:43,942 INFO L82 PathProgramCache]: Analyzing trace with hash 23508886, now seen corresponding path program 1 times
[2021-08-13 10:01:43,949 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-08-13 10:01:43,949 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739447655]
[2021-08-13 10:01:43,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-08-13 10:01:44,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-08-13 10:01:44,239 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-13 10:01:44,241 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-08-13 10:01:44,241 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-13 10:01:44,242 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-08-13 10:01:44,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-08-13 10:01:44,252 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-08-13 10:01:44,252 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739447655]
[2021-08-13 10:01:44,253 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739447655] provided 1 perfect and 0 imperfect interpolant sequences
[2021-08-13 10:01:44,254 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-08-13 10:01:44,254 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-08-13 10:01:44,255 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513843055]
[2021-08-13 10:01:44,263 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states
[2021-08-13 10:01:44,263 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-08-13 10:01:44,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-08-13 10:01:44,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-08-13 10:01:44,275 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 112
[2021-08-13 10:01:44,278 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 109 transitions, 227 flow. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-13 10:01:44,278 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-08-13 10:01:44,278 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 112
[2021-08-13 10:01:44,279 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-08-13 10:01:44,359 INFO L129 PetriNetUnfolder]: 13/175 cut-off events.
[2021-08-13 10:01:44,360 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-08-13 10:01:44,361 INFO L84 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 175 events. 13/175 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 399 event pairs, 5 based on Foata normal form. 6/171 useless extension candidates. Maximal degree in co-relation 163. Up to 25 conditions per place.
[2021-08-13 10:01:44,362 INFO L132 encePairwiseOnDemand]: 107/112 looper letters, 6 selfloop transitions, 2 changer transitions 0/107 dead transitions.
[2021-08-13 10:01:44,363 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 107 transitions, 239 flow
[2021-08-13 10:01:44,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2021-08-13 10:01:44,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-08-13 10:01:44,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 319 transitions.
[2021-08-13 10:01:44,374 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9494047619047619
[2021-08-13 10:01:44,375 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 319 transitions.
[2021-08-13 10:01:44,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 319 transitions.
[2021-08-13 10:01:44,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-08-13 10:01:44,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 319 transitions.
[2021-08-13 10:01:44,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-13 10:01:44,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-13 10:01:44,386 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-13 10:01:44,387 INFO L348 CegarLoopForPetriNet]: 117 programPoint places, 0 predicate places.
[2021-08-13 10:01:44,387 INFO L482 AbstractCegarLoop]: Abstraction has has 117 places, 107 transitions, 239 flow
[2021-08-13 10:01:44,388 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-13 10:01:44,388 INFO L258 CegarLoopForPetriNet]: Found error trace
[2021-08-13 10:01:44,388 INFO L266 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-08-13 10:01:44,388 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2021-08-13 10:01:44,388 INFO L430 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-08-13 10:01:44,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-08-13 10:01:44,389 INFO L82 PathProgramCache]: Analyzing trace with hash -191871396, now seen corresponding path program 1 times
[2021-08-13 10:01:44,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-08-13 10:01:44,389 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071867349]
[2021-08-13 10:01:44,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-08-13 10:01:44,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-08-13 10:01:44,582 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-13 10:01:44,584 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-08-13 10:01:44,585 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-13 10:01:44,585 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-08-13 10:01:44,595 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size
[2021-08-13 10:01:44,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25
[2021-08-13 10:01:44,617 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size
[2021-08-13 10:01:44,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19
[2021-08-13 10:01:44,633 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-13 10:01:44,633 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-08-13 10:01:44,642 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-13 10:01:44,643 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-08-13 10:01:44,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-13 10:01:44,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-08-13 10:01:44,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-08-13 10:01:44,653 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-08-13 10:01:44,654 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071867349]
[2021-08-13 10:01:44,654 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071867349] provided 1 perfect and 0 imperfect interpolant sequences
[2021-08-13 10:01:44,654 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-08-13 10:01:44,654 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-08-13 10:01:44,654 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844794904]
[2021-08-13 10:01:44,655 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-08-13 10:01:44,655 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-08-13 10:01:44,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-08-13 10:01:44,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2021-08-13 10:01:44,658 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 112
[2021-08-13 10:01:44,659 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 107 transitions, 239 flow. Second operand has 7 states, 7 states have (on average 91.71428571428571) internal successors, (642), 7 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-13 10:01:44,659 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-08-13 10:01:44,660 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 112
[2021-08-13 10:01:44,660 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-08-13 10:01:45,229 INFO L129 PetriNetUnfolder]: 672/2001 cut-off events.
[2021-08-13 10:01:45,229 INFO L130 PetriNetUnfolder]: For 243/270 co-relation queries the response was YES.
[2021-08-13 10:01:45,241 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3382 conditions, 2001 events. 672/2001 cut-off events. For 243/270 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 15608 event pairs, 264 based on Foata normal form. 0/1916 useless extension candidates. Maximal degree in co-relation 3322. Up to 499 conditions per place.
[2021-08-13 10:01:45,252 INFO L132 encePairwiseOnDemand]: 106/112 looper letters, 42 selfloop transitions, 10 changer transitions 18/157 dead transitions.
[2021-08-13 10:01:45,252 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 157 transitions, 521 flow
[2021-08-13 10:01:45,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2021-08-13 10:01:45,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2021-08-13 10:01:45,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 874 transitions.
[2021-08-13 10:01:45,259 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8670634920634921
[2021-08-13 10:01:45,259 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 874 transitions.
[2021-08-13 10:01:45,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 874 transitions.
[2021-08-13 10:01:45,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-08-13 10:01:45,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 874 transitions.
[2021-08-13 10:01:45,263 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.11111111111111) internal successors, (874), 9 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-13 10:01:45,267 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-13 10:01:45,268 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-13 10:01:45,268 INFO L348 CegarLoopForPetriNet]: 117 programPoint places, 8 predicate places.
[2021-08-13 10:01:45,268 INFO L482 AbstractCegarLoop]: Abstraction has has 125 places, 157 transitions, 521 flow
[2021-08-13 10:01:45,269 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 91.71428571428571) internal successors, (642), 7 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-13 10:01:45,269 INFO L258 CegarLoopForPetriNet]: Found error trace
[2021-08-13 10:01:45,269 INFO L266 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-08-13 10:01:45,269 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2021-08-13 10:01:45,269 INFO L430 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-08-13 10:01:45,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-08-13 10:01:45,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1028773139, now seen corresponding path program 1 times
[2021-08-13 10:01:45,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-08-13 10:01:45,277 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692183660]
[2021-08-13 10:01:45,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-08-13 10:01:45,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-08-13 10:01:45,423 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-13 10:01:45,424 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-08-13 10:01:45,424 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-13 10:01:45,425 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-08-13 10:01:45,429 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size
[2021-08-13 10:01:45,430 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25
[2021-08-13 10:01:45,443 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size
[2021-08-13 10:01:45,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19
[2021-08-13 10:01:45,461 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-13 10:01:45,461 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-08-13 10:01:45,469 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-13 10:01:45,471 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-08-13 10:01:45,480 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-13 10:01:45,480 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-08-13 10:01:45,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-08-13 10:01:45,482 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-08-13 10:01:45,482 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692183660]
[2021-08-13 10:01:45,483 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692183660] provided 1 perfect and 0 imperfect interpolant sequences
[2021-08-13 10:01:45,483 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-08-13 10:01:45,483 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-08-13 10:01:45,483 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426297029]
[2021-08-13 10:01:45,483 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-08-13 10:01:45,483 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-08-13 10:01:45,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-08-13 10:01:45,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2021-08-13 10:01:45,487 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 112
[2021-08-13 10:01:45,488 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 157 transitions, 521 flow. Second operand has 7 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-08-13 10:01:45,488 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-08-13 10:01:45,488 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 112
[2021-08-13 10:01:45,488 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-08-13 10:01:46,146 INFO L129 PetriNetUnfolder]: 916/2659 cut-off events.
[2021-08-13 10:01:46,147 INFO L130 PetriNetUnfolder]: For 427/670 co-relation queries the response was YES.
[2021-08-13 10:01:46,156 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6008 conditions, 2659 events. 916/2659 cut-off events. For 427/670 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 22617 event pairs, 68 based on Foata normal form. 0/2585 useless extension candidates. Maximal degree in co-relation 5940. Up to 633 conditions per place.
[2021-08-13 10:01:46,163 INFO L132 encePairwiseOnDemand]: 102/112 looper letters, 56 selfloop transitions, 15 changer transitions 100/258 dead transitions.
[2021-08-13 10:01:46,164 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 258 transitions, 1319 flow
[2021-08-13 10:01:46,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2021-08-13 10:01:46,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2021-08-13 10:01:46,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 964 transitions.
[2021-08-13 10:01:46,167 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8607142857142858
[2021-08-13 10:01:46,167 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 964 transitions.
[2021-08-13 10:01:46,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 964 transitions.
[2021-08-13 10:01:46,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-08-13 10:01:46,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 964 transitions.
[2021-08-13 10:01:46,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 96.4) internal successors, (964), 10 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-13 10:01:46,172 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-13 10:01:46,173 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-13 10:01:46,173 INFO L348 CegarLoopForPetriNet]: 117 programPoint places, 17 predicate places.
[2021-08-13 10:01:46,173 INFO L482 AbstractCegarLoop]: Abstraction has has 134 places, 258 transitions, 1319 flow
[2021-08-13 10:01:46,173 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 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-08-13 10:01:46,173 INFO L258 CegarLoopForPetriNet]: Found error trace
[2021-08-13 10:01:46,174 INFO L266 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]
[2021-08-13 10:01:46,174 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2021-08-13 10:01:46,174 INFO L430 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-08-13 10:01:46,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-08-13 10:01:46,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1830760426, now seen corresponding path program 1 times
[2021-08-13 10:01:46,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-08-13 10:01:46,176 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91325697]
[2021-08-13 10:01:46,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-08-13 10:01:46,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-08-13 10:01:46,317 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-13 10:01:46,317 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-08-13 10:01:46,318 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-13 10:01:46,318 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-08-13 10:01:46,324 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size
[2021-08-13 10:01:46,325 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19
[2021-08-13 10:01:46,339 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-13 10:01:46,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-08-13 10:01:46,347 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-13 10:01:46,348 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-08-13 10:01:46,356 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-13 10:01:46,356 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-08-13 10:01:46,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-08-13 10:01:46,358 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-08-13 10:01:46,359 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91325697]
[2021-08-13 10:01:46,360 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91325697] provided 1 perfect and 0 imperfect interpolant sequences
[2021-08-13 10:01:46,360 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-08-13 10:01:46,360 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-08-13 10:01:46,360 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243501273]
[2021-08-13 10:01:46,361 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-08-13 10:01:46,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-08-13 10:01:46,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-08-13 10:01:46,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-08-13 10:01:46,363 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 112
[2021-08-13 10:01:46,364 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 258 transitions, 1319 flow. Second operand has 6 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-13 10:01:46,364 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-08-13 10:01:46,364 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 112
[2021-08-13 10:01:46,364 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-08-13 10:01:47,236 INFO L129 PetriNetUnfolder]: 1401/4305 cut-off events.
[2021-08-13 10:01:47,236 INFO L130 PetriNetUnfolder]: For 996/1287 co-relation queries the response was YES.
[2021-08-13 10:01:47,256 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10431 conditions, 4305 events. 1401/4305 cut-off events. For 996/1287 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 41580 event pairs, 125 based on Foata normal form. 0/4173 useless extension candidates. Maximal degree in co-relation 10360. Up to 939 conditions per place.
[2021-08-13 10:01:47,266 INFO L132 encePairwiseOnDemand]: 106/112 looper letters, 32 selfloop transitions, 28 changer transitions 153/337 dead transitions.
[2021-08-13 10:01:47,266 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 337 transitions, 2093 flow
[2021-08-13 10:01:47,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2021-08-13 10:01:47,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2021-08-13 10:01:47,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 923 transitions.
[2021-08-13 10:01:47,268 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9156746031746031
[2021-08-13 10:01:47,268 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 923 transitions.
[2021-08-13 10:01:47,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 923 transitions.
[2021-08-13 10:01:47,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-08-13 10:01:47,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 923 transitions.
[2021-08-13 10:01:47,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 102.55555555555556) internal successors, (923), 9 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-13 10:01:47,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-13 10:01:47,273 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-13 10:01:47,273 INFO L348 CegarLoopForPetriNet]: 117 programPoint places, 25 predicate places.
[2021-08-13 10:01:47,273 INFO L482 AbstractCegarLoop]: Abstraction has has 142 places, 337 transitions, 2093 flow
[2021-08-13 10:01:47,273 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-13 10:01:47,273 INFO L258 CegarLoopForPetriNet]: Found error trace
[2021-08-13 10:01:47,273 INFO L266 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, 1, 1]
[2021-08-13 10:01:47,273 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2021-08-13 10:01:47,274 INFO L430 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-08-13 10:01:47,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-08-13 10:01:47,275 INFO L82 PathProgramCache]: Analyzing trace with hash 996257962, now seen corresponding path program 1 times
[2021-08-13 10:01:47,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-08-13 10:01:47,275 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445521532]
[2021-08-13 10:01:47,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-08-13 10:01:47,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-08-13 10:01:47,402 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-13 10:01:47,402 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-08-13 10:01:47,403 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-13 10:01:47,404 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-08-13 10:01:47,407 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size
[2021-08-13 10:01:47,408 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23
[2021-08-13 10:01:47,424 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-13 10:01:47,425 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7
[2021-08-13 10:01:47,433 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size
[2021-08-13 10:01:47,434 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-08-13 10:01:47,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-13 10:01:47,445 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-08-13 10:01:47,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-08-13 10:01:47,446 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-08-13 10:01:47,446 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445521532]
[2021-08-13 10:01:47,446 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445521532] provided 1 perfect and 0 imperfect interpolant sequences
[2021-08-13 10:01:47,446 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-08-13 10:01:47,447 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-08-13 10:01:47,447 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780156149]
[2021-08-13 10:01:47,447 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-08-13 10:01:47,447 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-08-13 10:01:47,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-08-13 10:01:47,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-08-13 10:01:47,449 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 112
[2021-08-13 10:01:47,449 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 337 transitions, 2093 flow. Second operand has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-13 10:01:47,450 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-08-13 10:01:47,450 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 112
[2021-08-13 10:01:47,450 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-08-13 10:01:48,080 INFO L129 PetriNetUnfolder]: 812/2954 cut-off events.
[2021-08-13 10:01:48,080 INFO L130 PetriNetUnfolder]: For 464/539 co-relation queries the response was YES.
[2021-08-13 10:01:48,096 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6507 conditions, 2954 events. 812/2954 cut-off events. For 464/539 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 27822 event pairs, 146 based on Foata normal form. 0/2791 useless extension candidates. Maximal degree in co-relation 6433. Up to 691 conditions per place.
[2021-08-13 10:01:48,108 INFO L132 encePairwiseOnDemand]: 102/112 looper letters, 24 selfloop transitions, 17 changer transitions 66/304 dead transitions.
[2021-08-13 10:01:48,108 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 304 transitions, 1731 flow
[2021-08-13 10:01:48,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2021-08-13 10:01:48,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2021-08-13 10:01:48,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1023 transitions.
[2021-08-13 10:01:48,111 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9133928571428571
[2021-08-13 10:01:48,111 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1023 transitions.
[2021-08-13 10:01:48,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1023 transitions.
[2021-08-13 10:01:48,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-08-13 10:01:48,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1023 transitions.
[2021-08-13 10:01:48,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 102.3) internal successors, (1023), 10 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-13 10:01:48,117 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-13 10:01:48,117 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-13 10:01:48,118 INFO L348 CegarLoopForPetriNet]: 117 programPoint places, 34 predicate places.
[2021-08-13 10:01:48,118 INFO L482 AbstractCegarLoop]: Abstraction has has 151 places, 304 transitions, 1731 flow
[2021-08-13 10:01:48,118 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-13 10:01:48,118 INFO L258 CegarLoopForPetriNet]: Found error trace
[2021-08-13 10:01:48,118 INFO L266 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, 1, 1, 1, 1]
[2021-08-13 10:01:48,118 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2021-08-13 10:01:48,118 INFO L430 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-08-13 10:01:48,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-08-13 10:01:48,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1561598723, now seen corresponding path program 1 times
[2021-08-13 10:01:48,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-08-13 10:01:48,119 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219165841]
[2021-08-13 10:01:48,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-08-13 10:01:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-08-13 10:01:48,276 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-13 10:01:48,277 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-08-13 10:01:48,278 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-13 10:01:48,278 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-08-13 10:01:48,282 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-13 10:01:48,282 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-08-13 10:01:48,289 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size
[2021-08-13 10:01:48,290 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25
[2021-08-13 10:01:48,307 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size
[2021-08-13 10:01:48,308 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19
[2021-08-13 10:01:48,326 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-13 10:01:48,327 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-08-13 10:01:48,336 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-13 10:01:48,337 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-08-13 10:01:48,347 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-13 10:01:48,348 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-08-13 10:01:48,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-08-13 10:01:48,349 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-08-13 10:01:48,349 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219165841]
[2021-08-13 10:01:48,349 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219165841] provided 1 perfect and 0 imperfect interpolant sequences
[2021-08-13 10:01:48,350 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-08-13 10:01:48,350 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2021-08-13 10:01:48,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154549333]
[2021-08-13 10:01:48,351 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states
[2021-08-13 10:01:48,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-08-13 10:01:48,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-08-13 10:01:48,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2021-08-13 10:01:48,353 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 112
[2021-08-13 10:01:48,354 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 304 transitions, 1731 flow. Second operand has 8 states, 8 states have (on average 90.25) internal successors, (722), 8 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-13 10:01:48,354 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-08-13 10:01:48,354 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 112
[2021-08-13 10:01:48,354 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-08-13 10:01:49,313 INFO L129 PetriNetUnfolder]: 1439/5034 cut-off events.
[2021-08-13 10:01:49,313 INFO L130 PetriNetUnfolder]: For 1823/2370 co-relation queries the response was YES.
[2021-08-13 10:01:49,342 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13014 conditions, 5034 events. 1439/5034 cut-off events. For 1823/2370 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 53110 event pairs, 199 based on Foata normal form. 8/4765 useless extension candidates. Maximal degree in co-relation 12931. Up to 1316 conditions per place.
[2021-08-13 10:01:49,359 INFO L132 encePairwiseOnDemand]: 100/112 looper letters, 166 selfloop transitions, 31 changer transitions 177/489 dead transitions.
[2021-08-13 10:01:49,359 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 489 transitions, 3897 flow
[2021-08-13 10:01:49,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2021-08-13 10:01:49,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2021-08-13 10:01:49,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 761 transitions.
[2021-08-13 10:01:49,362 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8493303571428571
[2021-08-13 10:01:49,362 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 761 transitions.
[2021-08-13 10:01:49,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 761 transitions.
[2021-08-13 10:01:49,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-08-13 10:01:49,362 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 761 transitions.
[2021-08-13 10:01:49,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 95.125) internal successors, (761), 8 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-13 10:01:49,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 112.0) internal successors, (1008), 9 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-13 10:01:49,366 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 112.0) internal successors, (1008), 9 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-13 10:01:49,366 INFO L348 CegarLoopForPetriNet]: 117 programPoint places, 41 predicate places.
[2021-08-13 10:01:49,366 INFO L482 AbstractCegarLoop]: Abstraction has has 158 places, 489 transitions, 3897 flow
[2021-08-13 10:01:49,367 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 90.25) internal successors, (722), 8 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-13 10:01:49,367 INFO L258 CegarLoopForPetriNet]: Found error trace
[2021-08-13 10:01:49,367 INFO L266 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, 1, 1, 1, 1]
[2021-08-13 10:01:49,367 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2021-08-13 10:01:49,367 INFO L430 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-08-13 10:01:49,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-08-13 10:01:49,368 INFO L82 PathProgramCache]: Analyzing trace with hash -411303615, now seen corresponding path program 2 times
[2021-08-13 10:01:49,368 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-08-13 10:01:49,368 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223165657]
[2021-08-13 10:01:49,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-08-13 10:01:49,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-08-13 10:01:49,427 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-13 10:01:49,427 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-08-13 10:01:49,428 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-13 10:01:49,428 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-08-13 10:01:49,431 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-13 10:01:49,431 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-08-13 10:01:49,435 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size
[2021-08-13 10:01:49,436 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23
[2021-08-13 10:01:49,451 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-13 10:01:49,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7
[2021-08-13 10:01:49,459 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size
[2021-08-13 10:01:49,460 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-08-13 10:01:49,468 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-13 10:01:49,468 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-08-13 10:01:49,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-08-13 10:01:49,469 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-08-13 10:01:49,469 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223165657]
[2021-08-13 10:01:49,469 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223165657] provided 1 perfect and 0 imperfect interpolant sequences
[2021-08-13 10:01:49,469 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-08-13 10:01:49,469 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-08-13 10:01:49,469 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179196282]
[2021-08-13 10:01:49,470 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-08-13 10:01:49,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-08-13 10:01:49,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-08-13 10:01:49,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2021-08-13 10:01:49,471 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 112
[2021-08-13 10:01:49,473 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 489 transitions, 3897 flow. Second operand has 7 states, 7 states have (on average 99.14285714285714) internal successors, (694), 7 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-13 10:01:49,473 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-08-13 10:01:49,473 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 112
[2021-08-13 10:01:49,473 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-08-13 10:01:49,955 INFO L129 PetriNetUnfolder]: 557/1984 cut-off events.
[2021-08-13 10:01:49,955 INFO L130 PetriNetUnfolder]: For 600/3125 co-relation queries the response was YES.
[2021-08-13 10:01:49,966 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5145 conditions, 1984 events. 557/1984 cut-off events. For 600/3125 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 17178 event pairs, 20 based on Foata normal form. 274/2119 useless extension candidates. Maximal degree in co-relation 5059. Up to 386 conditions per place.
[2021-08-13 10:01:49,977 INFO L132 encePairwiseOnDemand]: 102/112 looper letters, 22 selfloop transitions, 44 changer transitions 114/303 dead transitions.
[2021-08-13 10:01:49,977 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 303 transitions, 2031 flow
[2021-08-13 10:01:49,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2021-08-13 10:01:49,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2021-08-13 10:01:49,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1331 transitions.
[2021-08-13 10:01:49,981 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9141483516483516
[2021-08-13 10:01:49,981 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1331 transitions.
[2021-08-13 10:01:49,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1331 transitions.
[2021-08-13 10:01:49,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-08-13 10:01:49,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1331 transitions.
[2021-08-13 10:01:49,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 102.38461538461539) internal successors, (1331), 13 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-13 10:01:49,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-13 10:01:49,987 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-13 10:01:49,988 INFO L348 CegarLoopForPetriNet]: 117 programPoint places, 53 predicate places.
[2021-08-13 10:01:49,988 INFO L482 AbstractCegarLoop]: Abstraction has has 170 places, 303 transitions, 2031 flow
[2021-08-13 10:01:49,988 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 99.14285714285714) internal successors, (694), 7 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-13 10:01:49,988 INFO L258 CegarLoopForPetriNet]: Found error trace
[2021-08-13 10:01:49,988 INFO L266 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, 1, 1, 1, 1, 1, 1]
[2021-08-13 10:01:49,988 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2021-08-13 10:01:49,988 INFO L430 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-08-13 10:01:49,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-08-13 10:01:49,989 INFO L82 PathProgramCache]: Analyzing trace with hash -681525442, now seen corresponding path program 1 times
[2021-08-13 10:01:49,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-08-13 10:01:49,989 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337835873]
[2021-08-13 10:01:49,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-08-13 10:01:50,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-08-13 10:01:50,093 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-13 10:01:50,094 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-08-13 10:01:50,094 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-13 10:01:50,094 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-08-13 10:01:50,097 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-13 10:01:50,098 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-08-13 10:01:50,102 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-13 10:01:50,102 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-08-13 10:01:50,107 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size
[2021-08-13 10:01:50,109 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23
[2021-08-13 10:01:50,124 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-13 10:01:50,124 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7
[2021-08-13 10:01:50,133 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size
[2021-08-13 10:01:50,133 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-08-13 10:01:50,142 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-13 10:01:50,143 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-08-13 10:01:50,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-08-13 10:01:50,143 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-08-13 10:01:50,145 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337835873]
[2021-08-13 10:01:50,145 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337835873] provided 1 perfect and 0 imperfect interpolant sequences
[2021-08-13 10:01:50,145 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-08-13 10:01:50,145 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2021-08-13 10:01:50,145 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909525940]
[2021-08-13 10:01:50,146 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states
[2021-08-13 10:01:50,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-08-13 10:01:50,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-08-13 10:01:50,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2021-08-13 10:01:50,148 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 112
[2021-08-13 10:01:50,148 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 303 transitions, 2031 flow. Second operand has 8 states, 8 states have (on average 99.125) internal successors, (793), 8 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-13 10:01:50,148 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-08-13 10:01:50,148 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 112
[2021-08-13 10:01:50,149 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-08-13 10:01:50,619 INFO L129 PetriNetUnfolder]: 466/1474 cut-off events.
[2021-08-13 10:01:50,619 INFO L130 PetriNetUnfolder]: For 788/5327 co-relation queries the response was YES.
[2021-08-13 10:01:50,627 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4579 conditions, 1474 events. 466/1474 cut-off events. For 788/5327 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 12599 event pairs, 0 based on Foata normal form. 356/1714 useless extension candidates. Maximal degree in co-relation 4490. Up to 346 conditions per place.
[2021-08-13 10:01:50,631 INFO L132 encePairwiseOnDemand]: 102/112 looper letters, 19 selfloop transitions, 40 changer transitions 78/236 dead transitions.
[2021-08-13 10:01:50,631 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 236 transitions, 1525 flow
[2021-08-13 10:01:50,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2021-08-13 10:01:50,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states.
[2021-08-13 10:01:50,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1624 transitions.
[2021-08-13 10:01:50,635 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.90625
[2021-08-13 10:01:50,635 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1624 transitions.
[2021-08-13 10:01:50,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1624 transitions.
[2021-08-13 10:01:50,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-08-13 10:01:50,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1624 transitions.
[2021-08-13 10:01:50,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 101.5) internal successors, (1624), 16 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-13 10:01:50,642 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 112.0) internal successors, (1904), 17 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-13 10:01:50,643 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 112.0) internal successors, (1904), 17 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-13 10:01:50,643 INFO L348 CegarLoopForPetriNet]: 117 programPoint places, 50 predicate places.
[2021-08-13 10:01:50,643 INFO L482 AbstractCegarLoop]: Abstraction has has 167 places, 236 transitions, 1525 flow
[2021-08-13 10:01:50,644 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 99.125) internal successors, (793), 8 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-13 10:01:50,644 INFO L258 CegarLoopForPetriNet]: Found error trace
[2021-08-13 10:01:50,644 INFO L266 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, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-08-13 10:01:50,644 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2021-08-13 10:01:50,644 INFO L430 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-08-13 10:01:50,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-08-13 10:01:50,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1213572303, now seen corresponding path program 1 times
[2021-08-13 10:01:50,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-08-13 10:01:50,645 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141160652]
[2021-08-13 10:01:50,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-08-13 10:01:50,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-08-13 10:01:50,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-13 10:01:50,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-08-13 10:01:50,728 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-13 10:01:50,730 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-08-13 10:01:50,734 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size
[2021-08-13 10:01:50,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25
[2021-08-13 10:01:50,747 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size
[2021-08-13 10:01:50,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19
[2021-08-13 10:01:50,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-13 10:01:50,765 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-08-13 10:01:50,775 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-13 10:01:50,776 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-08-13 10:01:50,787 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-13 10:01:50,787 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-08-13 10:01:50,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-08-13 10:01:50,788 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-08-13 10:01:50,788 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141160652]
[2021-08-13 10:01:50,788 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141160652] provided 1 perfect and 0 imperfect interpolant sequences
[2021-08-13 10:01:50,788 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-08-13 10:01:50,788 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-08-13 10:01:50,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401222442]
[2021-08-13 10:01:50,789 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-08-13 10:01:50,789 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-08-13 10:01:50,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-08-13 10:01:50,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2021-08-13 10:01:50,790 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 112
[2021-08-13 10:01:50,791 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 236 transitions, 1525 flow. Second operand has 7 states, 7 states have (on average 90.85714285714286) internal successors, (636), 7 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-13 10:01:50,791 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-08-13 10:01:50,791 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 112
[2021-08-13 10:01:50,791 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-08-13 10:01:51,190 INFO L129 PetriNetUnfolder]: 868/2627 cut-off events.
[2021-08-13 10:01:51,191 INFO L130 PetriNetUnfolder]: For 1584/4334 co-relation queries the response was YES.
[2021-08-13 10:01:51,210 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8419 conditions, 2627 events. 868/2627 cut-off events. For 1584/4334 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 25831 event pairs, 4 based on Foata normal form. 7/2427 useless extension candidates. Maximal degree in co-relation 8321. Up to 656 conditions per place.
[2021-08-13 10:01:51,218 INFO L132 encePairwiseOnDemand]: 96/112 looper letters, 36 selfloop transitions, 19 changer transitions 79/265 dead transitions.
[2021-08-13 10:01:51,219 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 265 transitions, 1967 flow
[2021-08-13 10:01:51,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2021-08-13 10:01:51,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2021-08-13 10:01:51,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 739 transitions.
[2021-08-13 10:01:51,221 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8247767857142857
[2021-08-13 10:01:51,221 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 739 transitions.
[2021-08-13 10:01:51,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 739 transitions.
[2021-08-13 10:01:51,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-08-13 10:01:51,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 739 transitions.
[2021-08-13 10:01:51,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 92.375) internal successors, (739), 8 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-13 10:01:51,225 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 112.0) internal successors, (1008), 9 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-13 10:01:51,225 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 112.0) internal successors, (1008), 9 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-13 10:01:51,225 INFO L348 CegarLoopForPetriNet]: 117 programPoint places, 57 predicate places.
[2021-08-13 10:01:51,225 INFO L482 AbstractCegarLoop]: Abstraction has has 174 places, 265 transitions, 1967 flow
[2021-08-13 10:01:51,226 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 90.85714285714286) internal successors, (636), 7 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-13 10:01:51,226 INFO L258 CegarLoopForPetriNet]: Found error trace
[2021-08-13 10:01:51,226 INFO L266 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, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-08-13 10:01:51,226 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2021-08-13 10:01:51,226 INFO L430 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-08-13 10:01:51,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-08-13 10:01:51,226 INFO L82 PathProgramCache]: Analyzing trace with hash -84778811, now seen corresponding path program 2 times
[2021-08-13 10:01:51,227 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-08-13 10:01:51,227 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432811100]
[2021-08-13 10:01:51,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-08-13 10:01:51,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-08-13 10:01:51,305 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-13 10:01:51,305 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-08-13 10:01:51,306 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-13 10:01:51,306 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-08-13 10:01:51,309 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-13 10:01:51,309 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-08-13 10:01:51,314 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size
[2021-08-13 10:01:51,314 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25
[2021-08-13 10:01:51,327 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size
[2021-08-13 10:01:51,329 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19
[2021-08-13 10:01:51,346 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-13 10:01:51,347 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-08-13 10:01:51,413 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-13 10:01:51,414 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-08-13 10:01:51,425 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-13 10:01:51,425 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-08-13 10:01:51,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-08-13 10:01:51,426 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-08-13 10:01:51,426 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432811100]
[2021-08-13 10:01:51,426 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432811100] provided 1 perfect and 0 imperfect interpolant sequences
[2021-08-13 10:01:51,426 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-08-13 10:01:51,427 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2021-08-13 10:01:51,427 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843928140]
[2021-08-13 10:01:51,427 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states
[2021-08-13 10:01:51,427 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-08-13 10:01:51,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-08-13 10:01:51,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2021-08-13 10:01:51,429 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 112
[2021-08-13 10:01:51,429 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 265 transitions, 1967 flow. Second operand has 8 states, 8 states have (on average 90.5) internal successors, (724), 8 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-13 10:01:51,429 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-08-13 10:01:51,429 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 112
[2021-08-13 10:01:51,430 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-08-13 10:01:51,944 INFO L129 PetriNetUnfolder]: 1240/3546 cut-off events.
[2021-08-13 10:01:51,945 INFO L130 PetriNetUnfolder]: For 2333/5874 co-relation queries the response was YES.
[2021-08-13 10:01:51,972 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11666 conditions, 3546 events. 1240/3546 cut-off events. For 2333/5874 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 36574 event pairs, 5 based on Foata normal form. 26/3301 useless extension candidates. Maximal degree in co-relation 11559. Up to 932 conditions per place.
[2021-08-13 10:01:51,979 INFO L132 encePairwiseOnDemand]: 100/112 looper letters, 20 selfloop transitions, 7 changer transitions 133/283 dead transitions.
[2021-08-13 10:01:51,979 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 283 transitions, 2377 flow
[2021-08-13 10:01:51,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2021-08-13 10:01:51,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2021-08-13 10:01:51,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 739 transitions.
[2021-08-13 10:01:51,981 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8247767857142857
[2021-08-13 10:01:51,982 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 739 transitions.
[2021-08-13 10:01:51,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 739 transitions.
[2021-08-13 10:01:51,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-08-13 10:01:51,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 739 transitions.
[2021-08-13 10:01:51,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 92.375) internal successors, (739), 8 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-13 10:01:51,985 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 112.0) internal successors, (1008), 9 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-13 10:01:51,986 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 112.0) internal successors, (1008), 9 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-13 10:01:51,986 INFO L348 CegarLoopForPetriNet]: 117 programPoint places, 64 predicate places.
[2021-08-13 10:01:51,986 INFO L482 AbstractCegarLoop]: Abstraction has has 181 places, 283 transitions, 2377 flow
[2021-08-13 10:01:51,986 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 90.5) internal successors, (724), 8 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-13 10:01:51,986 INFO L258 CegarLoopForPetriNet]: Found error trace
[2021-08-13 10:01:51,987 INFO L266 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, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-08-13 10:01:51,987 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2021-08-13 10:01:51,987 INFO L430 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-08-13 10:01:51,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-08-13 10:01:51,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1659391401, now seen corresponding path program 3 times
[2021-08-13 10:01:51,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-08-13 10:01:51,988 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427003836]
[2021-08-13 10:01:51,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-08-13 10:01:52,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-08-13 10:01:52,043 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-08-13 10:01:52,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-08-13 10:01:52,128 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-08-13 10:01:52,173 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-08-13 10:01:52,174 INFO L651 BasicCegarLoop]: Counterexample might be feasible
[2021-08-13 10:01:52,174 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2021-08-13 10:01:52,177 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2021-08-13 10:01:52,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.08 10:01:52 BasicIcfg
[2021-08-13 10:01:52,368 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2021-08-13 10:01:52,369 INFO L168 Benchmark]: Toolchain (without parser) took 11473.07 ms. Allocated memory was 180.4 MB in the beginning and 924.8 MB in the end (delta: 744.5 MB). Free memory was 144.3 MB in the beginning and 501.0 MB in the end (delta: -356.7 MB). Peak memory consumption was 388.9 MB. Max. memory is 8.0 GB.
[2021-08-13 10:01:52,369 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 180.4 MB. Free memory was 162.3 MB in the beginning and 162.2 MB in the end (delta: 147.8 kB). There was no memory consumed. Max. memory is 8.0 GB.
[2021-08-13 10:01:52,370 INFO L168 Benchmark]: CACSL2BoogieTranslator took 620.23 ms. Allocated memory is still 180.4 MB. Free memory was 144.1 MB in the beginning and 140.1 MB in the end (delta: 4.0 MB). Peak memory consumption was 18.9 MB. Max. memory is 8.0 GB.
[2021-08-13 10:01:52,370 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.56 ms. Allocated memory is still 180.4 MB. Free memory was 140.1 MB in the beginning and 137.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB.
[2021-08-13 10:01:52,370 INFO L168 Benchmark]: Boogie Preprocessor took 64.25 ms. Allocated memory is still 180.4 MB. Free memory was 137.5 MB in the beginning and 134.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB.
[2021-08-13 10:01:52,371 INFO L168 Benchmark]: RCFGBuilder took 2042.92 ms. Allocated memory was 180.4 MB in the beginning and 232.8 MB in the end (delta: 52.4 MB). Free memory was 134.9 MB in the beginning and 101.6 MB in the end (delta: 33.2 MB). Peak memory consumption was 87.2 MB. Max. memory is 8.0 GB.
[2021-08-13 10:01:52,371 INFO L168 Benchmark]: TraceAbstraction took 8654.88 ms. Allocated memory was 232.8 MB in the beginning and 924.8 MB in the end (delta: 692.1 MB). Free memory was 101.1 MB in the beginning and 501.0 MB in the end (delta: -399.9 MB). Peak memory consumption was 292.7 MB. Max. memory is 8.0 GB.
[2021-08-13 10:01:52,372 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.14 ms. Allocated memory is still 180.4 MB. Free memory was 162.3 MB in the beginning and 162.2 MB in the end (delta: 147.8 kB). There was no memory consumed. Max. memory is 8.0 GB.
* CACSL2BoogieTranslator took 620.23 ms. Allocated memory is still 180.4 MB. Free memory was 144.1 MB in the beginning and 140.1 MB in the end (delta: 4.0 MB). Peak memory consumption was 18.9 MB. Max. memory is 8.0 GB.
* Boogie Procedure Inliner took 84.56 ms. Allocated memory is still 180.4 MB. Free memory was 140.1 MB in the beginning and 137.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB.
* Boogie Preprocessor took 64.25 ms. Allocated memory is still 180.4 MB. Free memory was 137.5 MB in the beginning and 134.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB.
* RCFGBuilder took 2042.92 ms. Allocated memory was 180.4 MB in the beginning and 232.8 MB in the end (delta: 52.4 MB). Free memory was 134.9 MB in the beginning and 101.6 MB in the end (delta: 33.2 MB). Peak memory consumption was 87.2 MB. Max. memory is 8.0 GB.
* TraceAbstraction took 8654.88 ms. Allocated memory was 232.8 MB in the beginning and 924.8 MB in the end (delta: 692.1 MB). Free memory was 101.1 MB in the beginning and 501.0 MB in the end (delta: -399.9 MB). Peak memory consumption was 292.7 MB. Max. memory is 8.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_p1_EBX = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0]
[L719] 0 int __unbuffered_p2_EAX = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0]
[L721] 0 int __unbuffered_p2_EBX = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0]
[L722] 0 _Bool main$tmp_guard0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0]
[L728] 0 _Bool y$flush_delayed;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0]
[L729] 0 int y$mem_tmp;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0]
[L730] 0 _Bool y$r_buff0_thd0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0]
[L731] 0 _Bool y$r_buff0_thd1;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0]
[L732] 0 _Bool y$r_buff0_thd2;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0]
[L733] 0 _Bool y$r_buff0_thd3;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0]
[L734] 0 _Bool y$r_buff1_thd0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0]
[L735] 0 _Bool y$r_buff1_thd1;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0]
[L736] 0 _Bool y$r_buff1_thd2;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0]
[L737] 0 _Bool y$r_buff1_thd3;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0]
[L738] 0 _Bool y$read_delayed;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0]
[L739] 0 int *y$read_delayed_var;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}]
[L740] 0 int y$w_buff0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0]
[L741] 0 _Bool y$w_buff0_used;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0]
[L742] 0 int y$w_buff1;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0]
[L743] 0 _Bool y$w_buff1_used;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L745] 0 int z = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L746] 0 _Bool weak$$choice0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L747] 0 _Bool weak$$choice2;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L853] 0 pthread_t t23;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L854] FCALL, FORK 0 pthread_create(&t23, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L855] 0 pthread_t t24;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L856] FCALL, FORK 0 pthread_create(&t24, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L857] 0 pthread_t t25;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L858] FCALL, FORK 0 pthread_create(&t25, ((void *)0), P2, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L800] 3 y$w_buff1 = y$w_buff0
[L801] 3 y$w_buff0 = 1
[L802] 3 y$w_buff1_used = y$w_buff0_used
[L803] 3 y$w_buff0_used = (_Bool)1
[L18] COND FALSE 3 !(!expression)
[L805] 3 y$r_buff1_thd0 = y$r_buff0_thd0
[L806] 3 y$r_buff1_thd1 = y$r_buff0_thd1
[L807] 3 y$r_buff1_thd2 = y$r_buff0_thd2
[L808] 3 y$r_buff1_thd3 = y$r_buff0_thd3
[L809] 3 y$r_buff0_thd3 = (_Bool)1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L812] 3 weak$$choice0 = __VERIFIER_nondet_bool()
[L813] 3 weak$$choice2 = __VERIFIER_nondet_bool()
[L814] 3 y$flush_delayed = weak$$choice2
[L815] 3 y$mem_tmp = y
[L816] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)
[L816] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1
[L816] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)
[L816] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)
[L817] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L817] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L818] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L818] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L819] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L819] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L820] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L820] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L821] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L821] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L822] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L822] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L823] 3 __unbuffered_p2_EAX = y
[L824] EXPR 3 y$flush_delayed ? y$mem_tmp : y
[L824] 3 y = y$flush_delayed ? y$mem_tmp : y
[L825] 3 y$flush_delayed = (_Bool)0
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L828] 3 __unbuffered_p2_EBX = z
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L751] 1 z = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L754] 1 __unbuffered_p0_EAX = z
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L757] 1 __unbuffered_p0_EBX = x
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L769] 2 x = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L772] 2 __unbuffered_p1_EAX = x
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L775] 2 weak$$choice0 = __VERIFIER_nondet_bool()
[L776] 2 weak$$choice2 = __VERIFIER_nondet_bool()
[L777] 2 y$flush_delayed = weak$$choice2
[L778] 2 y$mem_tmp = y
[L779] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)
[L779] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)
[L780] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))
[L780] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)
[L780] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))
[L780] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))
[L781] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))
[L781] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)
[L781] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))
[L781] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))
[L782] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))
[L782] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)
[L782] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))
[L782] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))
[L783] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L783] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)
[L783] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L783] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L784] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))
[L784] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)
[L784] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))
[L784] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))
[L785] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L785] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)
[L785] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L785] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L786] 2 __unbuffered_p1_EBX = y
[L787] EXPR 2 y$flush_delayed ? y$mem_tmp : y
[L787] 2 y = y$flush_delayed ? y$mem_tmp : y
[L788] 2 y$flush_delayed = (_Bool)0
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L831] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L831] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L832] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L832] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L833] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L833] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L834] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L834] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L835] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L835] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3
VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L3] COND FALSE 0 !(!cond)
VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L864] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L864] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y
[L864] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L864] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L865] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L865] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L866] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L866] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L867] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L867] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L868] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
[L868] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
[L871] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0)
VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L18] COND TRUE 0 !expression
VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L18] 0 reach_error()
VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1]
- StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
CFG has 7 procedures, 140 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 13.9ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 8308.5ms, OverallIterations: 11, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 6022.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 51.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 177 SDtfs, 345 SDslu, 620 SDs, 0 SdLazy, 473 SolverSat, 95 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 524.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1111.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=3897occurred in iteration=6, InterpolantAutomatonStates: 94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 47.7ms SsaConstructionTime, 564.8ms SatisfiabilityAnalysisTime, 1231.2ms InterpolantComputationTime, 881 NumberOfCodeBlocks, 881 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 783 ConstructedInterpolants, 0 QuantifiedInterpolants, 4237 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...