/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix029_rmo.opt.i
--------------------------------------------------------------------------------
This is Ultimate 0.2.1-98707888a4ba860d5b57d27ee0e051c5b948cbbf-9870788
[2021-06-01 15:46:11,197 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2021-06-01 15:46:11,199 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2021-06-01 15:46:11,223 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-06-01 15:46:11,224 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-06-01 15:46:11,225 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-06-01 15:46:11,226 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-06-01 15:46:11,228 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2021-06-01 15:46:11,229 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-06-01 15:46:11,230 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-06-01 15:46:11,231 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2021-06-01 15:46:11,232 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-06-01 15:46:11,232 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-06-01 15:46:11,233 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-06-01 15:46:11,234 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-06-01 15:46:11,235 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-06-01 15:46:11,236 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-06-01 15:46:11,236 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-06-01 15:46:11,238 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-06-01 15:46:11,239 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2021-06-01 15:46:11,242 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-06-01 15:46:11,249 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-06-01 15:46:11,250 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2021-06-01 15:46:11,253 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-06-01 15:46:11,260 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-06-01 15:46:11,260 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-06-01 15:46:11,260 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-06-01 15:46:11,261 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-06-01 15:46:11,261 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-06-01 15:46:11,262 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-06-01 15:46:11,262 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-06-01 15:46:11,263 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-06-01 15:46:11,263 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-06-01 15:46:11,264 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2021-06-01 15:46:11,265 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-06-01 15:46:11,265 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2021-06-01 15:46:11,266 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-06-01 15:46:11,266 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-06-01 15:46:11,266 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2021-06-01 15:46:11,267 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2021-06-01 15:46:11,267 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2021-06-01 15:46:11,277 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-FA-NoLbe.epf
[2021-06-01 15:46:11,309 INFO L113 SettingsManager]: Loading preferences was successful
[2021-06-01 15:46:11,309 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2021-06-01 15:46:11,310 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2021-06-01 15:46:11,310 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2021-06-01 15:46:11,312 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-06-01 15:46:11,312 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2021-06-01 15:46:11,312 INFO L138 SettingsManager]: * Use SBE=true
[2021-06-01 15:46:11,313 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-06-01 15:46:11,313 INFO L138 SettingsManager]: * sizeof long=4
[2021-06-01 15:46:11,313 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2021-06-01 15:46:11,314 INFO L138 SettingsManager]: * sizeof POINTER=4
[2021-06-01 15:46:11,314 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2021-06-01 15:46:11,314 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2021-06-01 15:46:11,314 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2021-06-01 15:46:11,314 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2021-06-01 15:46:11,314 INFO L138 SettingsManager]: * sizeof long double=12
[2021-06-01 15:46:11,315 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2021-06-01 15:46:11,315 INFO L138 SettingsManager]: * Use constant arrays=true
[2021-06-01 15:46:11,315 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2021-06-01 15:46:11,315 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-06-01 15:46:11,315 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2021-06-01 15:46:11,315 INFO L138 SettingsManager]: * To the following directory=./dump/
[2021-06-01 15:46:11,316 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2021-06-01 15:46:11,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-06-01 15:46:11,316 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-06-01 15:46:11,316 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2021-06-01 15:46:11,316 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2021-06-01 15:46:11,316 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2021-06-01 15:46:11,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2021-06-01 15:46:11,317 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF
[2021-06-01 15:46:11,317 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2021-06-01 15:46:11,317 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
[2021-06-01 15:46:11,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2021-06-01 15:46:11,656 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-06-01 15:46:11,659 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-06-01 15:46:11,660 INFO L271 PluginConnector]: Initializing CDTParser...
[2021-06-01 15:46:11,660 INFO L275 PluginConnector]: CDTParser initialized
[2021-06-01 15:46:11,661 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix029_rmo.opt.i
[2021-06-01 15:46:11,721 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b67d515c2/8b407eba7c75489cba11bc4fd02dc2fd/FLAGf1d4a7051
[2021-06-01 15:46:12,239 INFO L306 CDTParser]: Found 1 translation units.
[2021-06-01 15:46:12,240 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix029_rmo.opt.i
[2021-06-01 15:46:12,257 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b67d515c2/8b407eba7c75489cba11bc4fd02dc2fd/FLAGf1d4a7051
[2021-06-01 15:46:12,738 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b67d515c2/8b407eba7c75489cba11bc4fd02dc2fd
[2021-06-01 15:46:12,741 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-06-01 15:46:12,743 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements.
[2021-06-01 15:46:12,744 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-06-01 15:46:12,745 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-06-01 15:46:12,748 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2021-06-01 15:46:12,748 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.06 03:46:12" (1/1) ...
[2021-06-01 15:46:12,749 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@699713d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 03:46:12, skipping insertion in model container
[2021-06-01 15:46:12,749 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.06 03:46:12" (1/1) ...
[2021-06-01 15:46:12,757 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2021-06-01 15:46:12,794 INFO L178 MainTranslator]: Built tables and reachable declarations
[2021-06-01 15:46:12,913 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/mix029_rmo.opt.i[948,961]
[2021-06-01 15:46:13,129 INFO L206 PostProcessor]: Analyzing one entry point: main
[2021-06-01 15:46:13,136 INFO L203 MainTranslator]: Completed pre-run
[2021-06-01 15:46:13,147 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/mix029_rmo.opt.i[948,961]
[2021-06-01 15:46:13,199 INFO L206 PostProcessor]: Analyzing one entry point: main
[2021-06-01 15:46:13,271 INFO L208 MainTranslator]: Completed translation
[2021-06-01 15:46:13,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 03:46:13 WrapperNode
[2021-06-01 15:46:13,272 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-06-01 15:46:13,273 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-06-01 15:46:13,273 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-06-01 15:46:13,273 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2021-06-01 15:46:13,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 03:46:13" (1/1) ...
[2021-06-01 15:46:13,294 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 03:46:13" (1/1) ...
[2021-06-01 15:46:13,320 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-06-01 15:46:13,321 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-06-01 15:46:13,321 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2021-06-01 15:46:13,321 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2021-06-01 15:46:13,328 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 03:46:13" (1/1) ...
[2021-06-01 15:46:13,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 03:46:13" (1/1) ...
[2021-06-01 15:46:13,333 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 03:46:13" (1/1) ...
[2021-06-01 15:46:13,333 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 03:46:13" (1/1) ...
[2021-06-01 15:46:13,342 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 03:46:13" (1/1) ...
[2021-06-01 15:46:13,346 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 03:46:13" (1/1) ...
[2021-06-01 15:46:13,349 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 03:46:13" (1/1) ...
[2021-06-01 15:46:13,353 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-06-01 15:46:13,354 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-06-01 15:46:13,354 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2021-06-01 15:46:13,354 INFO L275 PluginConnector]: RCFGBuilder initialized
[2021-06-01 15:46:13,355 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 03:46:13" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-06-01 15:46:13,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2021-06-01 15:46:13,430 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2021-06-01 15:46:13,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-06-01 15:46:13,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2021-06-01 15:46:13,431 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2021-06-01 15:46:13,431 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2021-06-01 15:46:13,431 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2021-06-01 15:46:13,431 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2021-06-01 15:46:13,431 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2021-06-01 15:46:13,431 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2021-06-01 15:46:13,432 INFO L130 BoogieDeclarations]: Found specification of procedure P3
[2021-06-01 15:46:13,432 INFO L138 BoogieDeclarations]: Found implementation of procedure P3
[2021-06-01 15:46:13,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2021-06-01 15:46:13,432 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2021-06-01 15:46:13,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-06-01 15:46:13,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-06-01 15:46:13,434 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2021-06-01 15:46:15,322 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-06-01 15:46:15,323 INFO L299 CfgBuilder]: Removed 10 assume(true) statements.
[2021-06-01 15:46:15,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.06 03:46:15 BoogieIcfgContainer
[2021-06-01 15:46:15,325 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-06-01 15:46:15,326 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2021-06-01 15:46:15,326 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2021-06-01 15:46:15,329 INFO L275 PluginConnector]: TraceAbstraction initialized
[2021-06-01 15:46:15,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.06 03:46:12" (1/3) ...
[2021-06-01 15:46:15,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@399e6822 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.06 03:46:15, skipping insertion in model container
[2021-06-01 15:46:15,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 03:46:13" (2/3) ...
[2021-06-01 15:46:15,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@399e6822 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.06 03:46:15, skipping insertion in model container
[2021-06-01 15:46:15,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.06 03:46:15" (3/3) ...
[2021-06-01 15:46:15,331 INFO L111 eAbstractionObserver]: Analyzing ICFG mix029_rmo.opt.i
[2021-06-01 15:46:15,337 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2021-06-01 15:46:15,337 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2021-06-01 15:46:15,338 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2021-06-01 15:46:15,338 INFO L471 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2021-06-01 15:46:15,377 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,377 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,377 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,377 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,377 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,377 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,378 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,378 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,378 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,378 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,378 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,378 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,379 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,379 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,379 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,379 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,379 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,379 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,379 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,379 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,380 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,380 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,380 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,380 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,380 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,380 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,380 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,381 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,381 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,381 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,381 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,381 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,381 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,381 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,382 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,382 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,382 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,382 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,383 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,383 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,383 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,383 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,383 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,384 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,384 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,384 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,384 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,384 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,384 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,384 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,386 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,386 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,386 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,386 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,386 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,386 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,386 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,387 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,387 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,387 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,387 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,387 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,387 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,388 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,388 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,388 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,388 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,388 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,388 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,388 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,389 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,389 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,389 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,389 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,389 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,389 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,390 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,390 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,390 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,390 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,390 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,390 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,390 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,391 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,391 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,391 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,391 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,393 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,394 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,394 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,394 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,394 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,394 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,394 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,394 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,395 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,395 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,396 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,396 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,397 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,397 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,397 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,397 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,397 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,397 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,397 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,397 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,399 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,399 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,399 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,399 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,399 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,399 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,399 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,399 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,400 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,401 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,401 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,402 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,402 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:46:15,402 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2021-06-01 15:46:15,422 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2021-06-01 15:46:15,438 INFO L378 AbstractCegarLoop]: Interprodecural is true
[2021-06-01 15:46:15,438 INFO L379 AbstractCegarLoop]: Hoare is false
[2021-06-01 15:46:15,439 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-06-01 15:46:15,439 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-06-01 15:46:15,439 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-06-01 15:46:15,439 INFO L383 AbstractCegarLoop]: Difference is false
[2021-06-01 15:46:15,439 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-06-01 15:46:15,439 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P2========
[2021-06-01 15:46:15,449 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 139 places, 128 transitions, 276 flow
[2021-06-01 15:46:43,886 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 135557 states, 135553 states have (on average 4.5131424608824595) internal successors, (611770), 135556 states have internal predecessors, (611770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:46:44,117 INFO L276 IsEmpty]: Start isEmpty. Operand has 135557 states, 135553 states have (on average 4.5131424608824595) internal successors, (611770), 135556 states have internal predecessors, (611770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:46:45,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2021-06-01 15:46:45,199 INFO L301 ceAbstractionStarter]: Result for error location P2 was SAFE (1/3)
[2021-06-01 15:46:45,201 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2021-06-01 15:46:45,211 INFO L378 AbstractCegarLoop]: Interprodecural is true
[2021-06-01 15:46:45,211 INFO L379 AbstractCegarLoop]: Hoare is false
[2021-06-01 15:46:45,211 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-06-01 15:46:45,212 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-06-01 15:46:45,212 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-06-01 15:46:45,212 INFO L383 AbstractCegarLoop]: Difference is false
[2021-06-01 15:46:45,212 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-06-01 15:46:45,212 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P2Thread1of1ForFork2========
[2021-06-01 15:46:45,222 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 139 places, 128 transitions, 276 flow
[2021-06-01 15:47:11,507 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 135557 states, 135553 states have (on average 4.5131424608824595) internal successors, (611770), 135556 states have internal predecessors, (611770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:47:11,950 INFO L276 IsEmpty]: Start isEmpty. Operand has 135557 states, 135553 states have (on average 4.5131424608824595) internal successors, (611770), 135556 states have internal predecessors, (611770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:47:11,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61
[2021-06-01 15:47:11,974 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 15:47:11,975 INFO L554 BasicCegarLoop]: 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-06-01 15:47:11,977 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 15:47:11,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 15:47:11,981 INFO L82 PathProgramCache]: Analyzing trace with hash -803804790, now seen corresponding path program 1 times
[2021-06-01 15:47:11,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 15:47:11,996 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626613016]
[2021-06-01 15:47:11,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 15:47:12,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 15:47:12,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 15:47:12,333 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 15:47:12,333 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626613016]
[2021-06-01 15:47:12,334 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626613016] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 15:47:12,334 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 15:47:12,334 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-06-01 15:47:12,335 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507444829]
[2021-06-01 15:47:12,339 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states
[2021-06-01 15:47:12,339 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 15:47:12,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-06-01 15:47:12,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-06-01 15:47:12,553 INFO L87 Difference]: Start difference. First operand has 135557 states, 135553 states have (on average 4.5131424608824595) internal successors, (611770), 135556 states have internal predecessors, (611770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 30.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:47:14,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 15:47:14,102 INFO L93 Difference]: Finished difference Result 116517 states and 516070 transitions.
[2021-06-01 15:47:14,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2021-06-01 15:47:14,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 30.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60
[2021-06-01 15:47:14,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 15:47:14,120 INFO L225 Difference]: With dead ends: 116517
[2021-06-01 15:47:14,120 INFO L226 Difference]: Without dead ends: 0
[2021-06-01 15:47:14,121 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-06-01 15:47:14,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2021-06-01 15:47:14,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2021-06-01 15:47:14,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:47:14,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2021-06-01 15:47:14,139 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 60
[2021-06-01 15:47:14,139 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 15:47:14,140 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2021-06-01 15:47:14,140 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 30.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:47:14,140 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2021-06-01 15:47:14,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2021-06-01 15:47:14,141 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2021-06-01 15:47:14,142 INFO L301 ceAbstractionStarter]: Result for error location P2Thread1of1ForFork2 was SAFE (2/3)
[2021-06-01 15:47:14,143 INFO L255 AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2021-06-01 15:47:14,144 INFO L378 AbstractCegarLoop]: Interprodecural is true
[2021-06-01 15:47:14,144 INFO L379 AbstractCegarLoop]: Hoare is false
[2021-06-01 15:47:14,144 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-06-01 15:47:14,144 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-06-01 15:47:14,144 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-06-01 15:47:14,144 INFO L383 AbstractCegarLoop]: Difference is false
[2021-06-01 15:47:14,148 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-06-01 15:47:14,148 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start========
[2021-06-01 15:47:14,152 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 139 places, 128 transitions, 276 flow
[2021-06-01 15:47:39,801 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 135557 states, 135553 states have (on average 4.5131424608824595) internal successors, (611770), 135556 states have internal predecessors, (611770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:47:40,002 INFO L276 IsEmpty]: Start isEmpty. Operand has 135557 states, 135553 states have (on average 4.5131424608824595) internal successors, (611770), 135556 states have internal predecessors, (611770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:47:40,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80
[2021-06-01 15:47:40,066 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 15:47:40,066 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 15:47:40,066 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 15:47:40,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 15:47:40,067 INFO L82 PathProgramCache]: Analyzing trace with hash -2144397672, now seen corresponding path program 1 times
[2021-06-01 15:47:40,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 15:47:40,067 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265141055]
[2021-06-01 15:47:40,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 15:47:40,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 15:47:40,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 15:47:40,318 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 15:47:40,323 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265141055]
[2021-06-01 15:47:40,324 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265141055] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 15:47:40,324 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 15:47:40,324 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-06-01 15:47:40,325 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862930049]
[2021-06-01 15:47:40,326 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-06-01 15:47:40,326 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 15:47:40,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-06-01 15:47:40,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-06-01 15:47:40,485 INFO L87 Difference]: Start difference. First operand has 135557 states, 135553 states have (on average 4.5131424608824595) internal successors, (611770), 135556 states have internal predecessors, (611770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:47:42,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 15:47:42,745 INFO L93 Difference]: Finished difference Result 195533 states and 867305 transitions.
[2021-06-01 15:47:42,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2021-06-01 15:47:42,746 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79
[2021-06-01 15:47:42,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 15:47:43,266 INFO L225 Difference]: With dead ends: 195533
[2021-06-01 15:47:43,266 INFO L226 Difference]: Without dead ends: 69365
[2021-06-01 15:47:43,267 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 95.8ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2021-06-01 15:47:44,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69365 states.
[2021-06-01 15:47:46,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69365 to 69365.
[2021-06-01 15:47:46,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69365 states, 69363 states have (on average 4.376684976140017) internal successors, (303580), 69364 states have internal predecessors, (303580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:47:47,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69365 states to 69365 states and 303580 transitions.
[2021-06-01 15:47:47,286 INFO L78 Accepts]: Start accepts. Automaton has 69365 states and 303580 transitions. Word has length 79
[2021-06-01 15:47:47,288 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 15:47:47,288 INFO L482 AbstractCegarLoop]: Abstraction has 69365 states and 303580 transitions.
[2021-06-01 15:47:47,288 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:47:47,288 INFO L276 IsEmpty]: Start isEmpty. Operand 69365 states and 303580 transitions.
[2021-06-01 15:47:47,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82
[2021-06-01 15:47:47,382 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 15:47:47,382 INFO L554 BasicCegarLoop]: 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-06-01 15:47:47,383 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2021-06-01 15:47:47,383 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 15:47:47,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 15:47:47,383 INFO L82 PathProgramCache]: Analyzing trace with hash 150213817, now seen corresponding path program 1 times
[2021-06-01 15:47:47,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 15:47:47,384 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527123158]
[2021-06-01 15:47:47,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 15:47:47,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 15:47:47,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 15:47:47,559 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 15:47:47,559 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527123158]
[2021-06-01 15:47:47,559 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527123158] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 15:47:47,559 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 15:47:47,560 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-06-01 15:47:47,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29885520]
[2021-06-01 15:47:47,561 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-06-01 15:47:47,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 15:47:47,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-06-01 15:47:47,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-06-01 15:47:47,562 INFO L87 Difference]: Start difference. First operand 69365 states and 303580 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:47:48,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 15:47:48,645 INFO L93 Difference]: Finished difference Result 79333 states and 344702 transitions.
[2021-06-01 15:47:48,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2021-06-01 15:47:48,645 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81
[2021-06-01 15:47:48,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 15:47:48,928 INFO L225 Difference]: With dead ends: 79333
[2021-06-01 15:47:48,928 INFO L226 Difference]: Without dead ends: 62981
[2021-06-01 15:47:48,929 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 105.2ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2021-06-01 15:47:49,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62981 states.
[2021-06-01 15:47:50,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62981 to 62981.
[2021-06-01 15:47:50,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62981 states, 62979 states have (on average 4.356658568729259) internal successors, (274378), 62980 states have internal predecessors, (274378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:47:51,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62981 states to 62981 states and 274378 transitions.
[2021-06-01 15:47:51,554 INFO L78 Accepts]: Start accepts. Automaton has 62981 states and 274378 transitions. Word has length 81
[2021-06-01 15:47:51,556 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 15:47:51,556 INFO L482 AbstractCegarLoop]: Abstraction has 62981 states and 274378 transitions.
[2021-06-01 15:47:51,556 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:47:51,556 INFO L276 IsEmpty]: Start isEmpty. Operand 62981 states and 274378 transitions.
[2021-06-01 15:47:51,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83
[2021-06-01 15:47:51,678 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 15:47:51,679 INFO L554 BasicCegarLoop]: 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]
[2021-06-01 15:47:51,679 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2021-06-01 15:47:51,679 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 15:47:51,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 15:47:51,680 INFO L82 PathProgramCache]: Analyzing trace with hash 758644152, now seen corresponding path program 1 times
[2021-06-01 15:47:51,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 15:47:51,680 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032453120]
[2021-06-01 15:47:51,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 15:47:51,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 15:47:51,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 15:47:51,970 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 15:47:51,970 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032453120]
[2021-06-01 15:47:51,970 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032453120] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 15:47:51,970 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 15:47:51,971 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2021-06-01 15:47:51,971 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63233467]
[2021-06-01 15:47:51,972 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states
[2021-06-01 15:47:51,972 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 15:47:51,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2021-06-01 15:47:51,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2021-06-01 15:47:51,978 INFO L87 Difference]: Start difference. First operand 62981 states and 274378 transitions. Second operand has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:47:52,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 15:47:52,707 INFO L93 Difference]: Finished difference Result 72557 states and 313456 transitions.
[2021-06-01 15:47:52,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2021-06-01 15:47:52,708 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82
[2021-06-01 15:47:52,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 15:47:53,482 INFO L225 Difference]: With dead ends: 72557
[2021-06-01 15:47:53,482 INFO L226 Difference]: Without dead ends: 60629
[2021-06-01 15:47:53,483 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 227.6ms TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306
[2021-06-01 15:47:53,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60629 states.
[2021-06-01 15:47:54,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60629 to 60629.
[2021-06-01 15:47:55,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60629 states, 60627 states have (on average 4.341399046629389) internal successors, (263206), 60628 states have internal predecessors, (263206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:47:55,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60629 states to 60629 states and 263206 transitions.
[2021-06-01 15:47:55,655 INFO L78 Accepts]: Start accepts. Automaton has 60629 states and 263206 transitions. Word has length 82
[2021-06-01 15:47:55,656 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 15:47:55,656 INFO L482 AbstractCegarLoop]: Abstraction has 60629 states and 263206 transitions.
[2021-06-01 15:47:55,659 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:47:55,660 INFO L276 IsEmpty]: Start isEmpty. Operand 60629 states and 263206 transitions.
[2021-06-01 15:47:55,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2021-06-01 15:47:55,744 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 15:47:55,744 INFO L554 BasicCegarLoop]: 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]
[2021-06-01 15:47:55,745 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2021-06-01 15:47:55,745 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 15:47:55,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 15:47:55,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1235717177, now seen corresponding path program 1 times
[2021-06-01 15:47:55,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 15:47:55,745 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949223231]
[2021-06-01 15:47:55,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 15:47:55,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 15:47:56,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 15:47:56,067 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 15:47:56,067 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949223231]
[2021-06-01 15:47:56,068 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949223231] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 15:47:56,068 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 15:47:56,068 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2021-06-01 15:47:56,068 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99870731]
[2021-06-01 15:47:56,068 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states
[2021-06-01 15:47:56,068 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 15:47:56,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2021-06-01 15:47:56,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132
[2021-06-01 15:47:56,069 INFO L87 Difference]: Start difference. First operand 60629 states and 263206 transitions. Second operand has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:47:57,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 15:47:57,125 INFO L93 Difference]: Finished difference Result 67811 states and 292553 transitions.
[2021-06-01 15:47:57,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2021-06-01 15:47:57,127 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84
[2021-06-01 15:47:57,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 15:47:57,427 INFO L225 Difference]: With dead ends: 67811
[2021-06-01 15:47:57,427 INFO L226 Difference]: Without dead ends: 60083
[2021-06-01 15:47:57,427 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 248.0ms TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380
[2021-06-01 15:47:57,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60083 states.
[2021-06-01 15:47:59,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60083 to 58361.
[2021-06-01 15:47:59,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58361 states, 58359 states have (on average 4.332510838088384) internal successors, (252841), 58360 states have internal predecessors, (252841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:47:59,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58361 states to 58361 states and 252841 transitions.
[2021-06-01 15:47:59,301 INFO L78 Accepts]: Start accepts. Automaton has 58361 states and 252841 transitions. Word has length 84
[2021-06-01 15:47:59,301 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 15:47:59,302 INFO L482 AbstractCegarLoop]: Abstraction has 58361 states and 252841 transitions.
[2021-06-01 15:47:59,302 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:47:59,302 INFO L276 IsEmpty]: Start isEmpty. Operand 58361 states and 252841 transitions.
[2021-06-01 15:47:59,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86
[2021-06-01 15:47:59,382 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 15:47:59,382 INFO L554 BasicCegarLoop]: 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-06-01 15:47:59,382 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2021-06-01 15:47:59,382 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 15:47:59,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 15:47:59,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1462804639, now seen corresponding path program 1 times
[2021-06-01 15:47:59,383 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 15:47:59,383 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683303889]
[2021-06-01 15:47:59,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 15:47:59,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 15:47:59,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 15:47:59,617 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 15:47:59,617 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683303889]
[2021-06-01 15:47:59,617 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683303889] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 15:47:59,617 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 15:47:59,617 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2021-06-01 15:47:59,617 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605627104]
[2021-06-01 15:47:59,618 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states
[2021-06-01 15:47:59,618 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 15:47:59,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2021-06-01 15:47:59,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2021-06-01 15:47:59,618 INFO L87 Difference]: Start difference. First operand 58361 states and 252841 transitions. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:48:00,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 15:48:00,914 INFO L93 Difference]: Finished difference Result 65949 states and 284440 transitions.
[2021-06-01 15:48:00,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2021-06-01 15:48:00,915 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85
[2021-06-01 15:48:00,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 15:48:01,098 INFO L225 Difference]: With dead ends: 65949
[2021-06-01 15:48:01,098 INFO L226 Difference]: Without dead ends: 57661
[2021-06-01 15:48:01,098 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 306.8ms TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380
[2021-06-01 15:48:01,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57661 states.
[2021-06-01 15:48:02,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57661 to 57661.
[2021-06-01 15:48:02,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57661 states, 57660 states have (on average 4.324245577523413) internal successors, (249336), 57660 states have internal predecessors, (249336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:48:03,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57661 states to 57661 states and 249336 transitions.
[2021-06-01 15:48:03,356 INFO L78 Accepts]: Start accepts. Automaton has 57661 states and 249336 transitions. Word has length 85
[2021-06-01 15:48:03,356 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 15:48:03,356 INFO L482 AbstractCegarLoop]: Abstraction has 57661 states and 249336 transitions.
[2021-06-01 15:48:03,357 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:48:03,357 INFO L276 IsEmpty]: Start isEmpty. Operand 57661 states and 249336 transitions.
[2021-06-01 15:48:03,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87
[2021-06-01 15:48:03,444 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 15:48:03,444 INFO L554 BasicCegarLoop]: 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]
[2021-06-01 15:48:03,444 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2021-06-01 15:48:03,445 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 15:48:03,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 15:48:03,445 INFO L82 PathProgramCache]: Analyzing trace with hash -997365609, now seen corresponding path program 1 times
[2021-06-01 15:48:03,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 15:48:03,445 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110532995]
[2021-06-01 15:48:03,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 15:48:03,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 15:48:03,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 15:48:03,868 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 15:48:03,868 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110532995]
[2021-06-01 15:48:03,869 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110532995] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 15:48:03,869 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 15:48:03,869 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2021-06-01 15:48:03,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890721842]
[2021-06-01 15:48:03,869 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states
[2021-06-01 15:48:03,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 15:48:03,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2021-06-01 15:48:03,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210
[2021-06-01 15:48:03,870 INFO L87 Difference]: Start difference. First operand 57661 states and 249336 transitions. Second operand has 15 states, 15 states have (on average 5.733333333333333) internal successors, (86), 15 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:48:04,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 15:48:04,459 INFO L93 Difference]: Finished difference Result 62029 states and 266716 transitions.
[2021-06-01 15:48:04,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2021-06-01 15:48:04,460 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.733333333333333) internal successors, (86), 15 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86
[2021-06-01 15:48:04,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 15:48:05,084 INFO L225 Difference]: With dead ends: 62029
[2021-06-01 15:48:05,084 INFO L226 Difference]: Without dead ends: 56653
[2021-06-01 15:48:05,085 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 339.8ms TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420
[2021-06-01 15:48:05,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56653 states.
[2021-06-01 15:48:06,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56653 to 56653.
[2021-06-01 15:48:06,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56653 states, 56652 states have (on average 4.3192120313492905) internal successors, (244692), 56652 states have internal predecessors, (244692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:48:06,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56653 states to 56653 states and 244692 transitions.
[2021-06-01 15:48:06,639 INFO L78 Accepts]: Start accepts. Automaton has 56653 states and 244692 transitions. Word has length 86
[2021-06-01 15:48:06,640 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 15:48:06,640 INFO L482 AbstractCegarLoop]: Abstraction has 56653 states and 244692 transitions.
[2021-06-01 15:48:06,640 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 5.733333333333333) internal successors, (86), 15 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:48:06,640 INFO L276 IsEmpty]: Start isEmpty. Operand 56653 states and 244692 transitions.
[2021-06-01 15:48:06,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87
[2021-06-01 15:48:06,717 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 15:48:06,717 INFO L554 BasicCegarLoop]: 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]
[2021-06-01 15:48:06,717 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2021-06-01 15:48:06,717 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 15:48:06,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 15:48:06,718 INFO L82 PathProgramCache]: Analyzing trace with hash -282457735, now seen corresponding path program 1 times
[2021-06-01 15:48:06,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 15:48:06,718 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869500591]
[2021-06-01 15:48:06,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 15:48:06,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 15:48:06,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 15:48:06,797 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 15:48:06,798 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869500591]
[2021-06-01 15:48:06,798 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869500591] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 15:48:06,798 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 15:48:06,798 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-06-01 15:48:06,798 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406068610]
[2021-06-01 15:48:06,798 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-06-01 15:48:06,798 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 15:48:06,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-06-01 15:48:06,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-06-01 15:48:06,799 INFO L87 Difference]: Start difference. First operand 56653 states and 244692 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:48:07,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 15:48:07,753 INFO L93 Difference]: Finished difference Result 87754 states and 377407 transitions.
[2021-06-01 15:48:07,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2021-06-01 15:48:07,754 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86
[2021-06-01 15:48:07,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 15:48:07,963 INFO L225 Difference]: With dead ends: 87754
[2021-06-01 15:48:07,963 INFO L226 Difference]: Without dead ends: 58669
[2021-06-01 15:48:07,964 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 56.0ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2021-06-01 15:48:08,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58669 states.
[2021-06-01 15:48:09,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58669 to 52369.
[2021-06-01 15:48:09,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52369 states, 52368 states have (on average 4.214520317751298) internal successors, (220706), 52368 states have internal predecessors, (220706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:48:09,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52369 states to 52369 states and 220706 transitions.
[2021-06-01 15:48:09,779 INFO L78 Accepts]: Start accepts. Automaton has 52369 states and 220706 transitions. Word has length 86
[2021-06-01 15:48:09,779 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 15:48:09,779 INFO L482 AbstractCegarLoop]: Abstraction has 52369 states and 220706 transitions.
[2021-06-01 15:48:09,780 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:48:09,780 INFO L276 IsEmpty]: Start isEmpty. Operand 52369 states and 220706 transitions.
[2021-06-01 15:48:09,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87
[2021-06-01 15:48:09,851 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 15:48:09,851 INFO L554 BasicCegarLoop]: 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]
[2021-06-01 15:48:09,851 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2021-06-01 15:48:09,851 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 15:48:09,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 15:48:09,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1236864421, now seen corresponding path program 2 times
[2021-06-01 15:48:09,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 15:48:09,852 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826012188]
[2021-06-01 15:48:09,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 15:48:09,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 15:48:09,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 15:48:09,948 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 15:48:09,948 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826012188]
[2021-06-01 15:48:09,948 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826012188] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 15:48:09,948 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 15:48:09,948 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-06-01 15:48:09,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926124235]
[2021-06-01 15:48:09,949 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-06-01 15:48:09,949 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 15:48:09,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-06-01 15:48:09,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-06-01 15:48:09,949 INFO L87 Difference]: Start difference. First operand 52369 states and 220706 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:48:10,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 15:48:10,901 INFO L93 Difference]: Finished difference Result 64409 states and 267516 transitions.
[2021-06-01 15:48:10,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2021-06-01 15:48:10,902 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86
[2021-06-01 15:48:10,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 15:48:11,040 INFO L225 Difference]: With dead ends: 64409
[2021-06-01 15:48:11,040 INFO L226 Difference]: Without dead ends: 47665
[2021-06-01 15:48:11,040 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 78.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2021-06-01 15:48:11,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47665 states.
[2021-06-01 15:48:12,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47665 to 47665.
[2021-06-01 15:48:12,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47665 states, 47664 states have (on average 4.152609936220208) internal successors, (197930), 47664 states have internal predecessors, (197930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:48:12,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47665 states to 47665 states and 197930 transitions.
[2021-06-01 15:48:12,515 INFO L78 Accepts]: Start accepts. Automaton has 47665 states and 197930 transitions. Word has length 86
[2021-06-01 15:48:12,515 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 15:48:12,515 INFO L482 AbstractCegarLoop]: Abstraction has 47665 states and 197930 transitions.
[2021-06-01 15:48:12,515 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:48:12,515 INFO L276 IsEmpty]: Start isEmpty. Operand 47665 states and 197930 transitions.
[2021-06-01 15:48:12,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88
[2021-06-01 15:48:12,579 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 15:48:12,580 INFO L554 BasicCegarLoop]: 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]
[2021-06-01 15:48:12,580 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2021-06-01 15:48:12,580 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 15:48:12,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 15:48:12,580 INFO L82 PathProgramCache]: Analyzing trace with hash -239171169, now seen corresponding path program 1 times
[2021-06-01 15:48:12,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 15:48:12,581 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726565356]
[2021-06-01 15:48:12,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 15:48:12,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 15:48:12,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 15:48:12,674 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 15:48:12,674 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726565356]
[2021-06-01 15:48:12,674 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726565356] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 15:48:12,674 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 15:48:12,674 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-06-01 15:48:12,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020172863]
[2021-06-01 15:48:12,675 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-06-01 15:48:12,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 15:48:12,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-06-01 15:48:12,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2021-06-01 15:48:12,675 INFO L87 Difference]: Start difference. First operand 47665 states and 197930 transitions. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:48:13,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 15:48:13,026 INFO L93 Difference]: Finished difference Result 49177 states and 199421 transitions.
[2021-06-01 15:48:13,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2021-06-01 15:48:13,026 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87
[2021-06-01 15:48:13,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 15:48:13,116 INFO L225 Difference]: With dead ends: 49177
[2021-06-01 15:48:13,116 INFO L226 Difference]: Without dead ends: 35137
[2021-06-01 15:48:13,117 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 87.3ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156
[2021-06-01 15:48:13,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35137 states.
[2021-06-01 15:48:14,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35137 to 34829.
[2021-06-01 15:48:14,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34829 states, 34828 states have (on average 4.019266107729413) internal successors, (139983), 34828 states have internal predecessors, (139983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:48:14,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34829 states to 34829 states and 139983 transitions.
[2021-06-01 15:48:14,352 INFO L78 Accepts]: Start accepts. Automaton has 34829 states and 139983 transitions. Word has length 87
[2021-06-01 15:48:14,353 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 15:48:14,353 INFO L482 AbstractCegarLoop]: Abstraction has 34829 states and 139983 transitions.
[2021-06-01 15:48:14,353 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:48:14,353 INFO L276 IsEmpty]: Start isEmpty. Operand 34829 states and 139983 transitions.
[2021-06-01 15:48:14,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91
[2021-06-01 15:48:14,403 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 15:48:14,403 INFO L554 BasicCegarLoop]: 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, 1, 1]
[2021-06-01 15:48:14,403 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2021-06-01 15:48:14,404 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 15:48:14,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 15:48:14,404 INFO L82 PathProgramCache]: Analyzing trace with hash 354376654, now seen corresponding path program 1 times
[2021-06-01 15:48:14,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 15:48:14,404 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342736927]
[2021-06-01 15:48:14,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 15:48:14,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 15:48:14,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 15:48:14,501 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 15:48:14,501 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342736927]
[2021-06-01 15:48:14,501 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342736927] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 15:48:14,501 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 15:48:14,501 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2021-06-01 15:48:14,503 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95433397]
[2021-06-01 15:48:14,503 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states
[2021-06-01 15:48:14,503 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 15:48:14,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-06-01 15:48:14,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2021-06-01 15:48:14,504 INFO L87 Difference]: Start difference. First operand 34829 states and 139983 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:48:15,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 15:48:15,212 INFO L93 Difference]: Finished difference Result 30275 states and 119088 transitions.
[2021-06-01 15:48:15,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2021-06-01 15:48:15,213 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90
[2021-06-01 15:48:15,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 15:48:15,314 INFO L225 Difference]: With dead ends: 30275
[2021-06-01 15:48:15,314 INFO L226 Difference]: Without dead ends: 22679
[2021-06-01 15:48:15,314 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 111.9ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210
[2021-06-01 15:48:15,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22679 states.
[2021-06-01 15:48:15,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22679 to 21363.
[2021-06-01 15:48:15,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21363 states, 21362 states have (on average 3.906001310738695) internal successors, (83440), 21362 states have internal predecessors, (83440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:48:15,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21363 states to 21363 states and 83440 transitions.
[2021-06-01 15:48:15,784 INFO L78 Accepts]: Start accepts. Automaton has 21363 states and 83440 transitions. Word has length 90
[2021-06-01 15:48:15,785 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 15:48:15,785 INFO L482 AbstractCegarLoop]: Abstraction has 21363 states and 83440 transitions.
[2021-06-01 15:48:15,785 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:48:15,785 INFO L276 IsEmpty]: Start isEmpty. Operand 21363 states and 83440 transitions.
[2021-06-01 15:48:15,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95
[2021-06-01 15:48:15,819 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 15:48:15,819 INFO L554 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1]
[2021-06-01 15:48:15,819 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2021-06-01 15:48:15,820 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 15:48:15,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 15:48:15,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1082338736, now seen corresponding path program 1 times
[2021-06-01 15:48:15,820 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 15:48:15,820 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156775268]
[2021-06-01 15:48:15,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 15:48:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 15:48:15,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 15:48:15,922 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 15:48:15,922 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156775268]
[2021-06-01 15:48:15,922 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156775268] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 15:48:15,922 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 15:48:15,923 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-06-01 15:48:15,923 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757395215]
[2021-06-01 15:48:15,923 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-06-01 15:48:15,923 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 15:48:15,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-06-01 15:48:15,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2021-06-01 15:48:15,924 INFO L87 Difference]: Start difference. First operand 21363 states and 83440 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:48:16,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 15:48:16,127 INFO L93 Difference]: Finished difference Result 30543 states and 118687 transitions.
[2021-06-01 15:48:16,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2021-06-01 15:48:16,128 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94
[2021-06-01 15:48:16,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 15:48:16,178 INFO L225 Difference]: With dead ends: 30543
[2021-06-01 15:48:16,179 INFO L226 Difference]: Without dead ends: 21453
[2021-06-01 15:48:16,179 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 74.9ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110
[2021-06-01 15:48:16,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21453 states.
[2021-06-01 15:48:16,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21453 to 20643.
[2021-06-01 15:48:16,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20643 states, 20642 states have (on average 3.84110066853987) internal successors, (79288), 20642 states have internal predecessors, (79288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:48:16,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20643 states to 20643 states and 79288 transitions.
[2021-06-01 15:48:16,856 INFO L78 Accepts]: Start accepts. Automaton has 20643 states and 79288 transitions. Word has length 94
[2021-06-01 15:48:16,857 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 15:48:16,857 INFO L482 AbstractCegarLoop]: Abstraction has 20643 states and 79288 transitions.
[2021-06-01 15:48:16,857 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:48:16,857 INFO L276 IsEmpty]: Start isEmpty. Operand 20643 states and 79288 transitions.
[2021-06-01 15:48:16,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95
[2021-06-01 15:48:16,887 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 15:48:16,887 INFO L554 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1]
[2021-06-01 15:48:16,887 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2021-06-01 15:48:16,887 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 15:48:16,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 15:48:16,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1905877388, now seen corresponding path program 2 times
[2021-06-01 15:48:16,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 15:48:16,888 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249130909]
[2021-06-01 15:48:16,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 15:48:16,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 15:48:17,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 15:48:17,000 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 15:48:17,000 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249130909]
[2021-06-01 15:48:17,000 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249130909] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 15:48:17,001 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 15:48:17,001 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2021-06-01 15:48:17,001 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051969736]
[2021-06-01 15:48:17,001 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states
[2021-06-01 15:48:17,001 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 15:48:17,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2021-06-01 15:48:17,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2021-06-01 15:48:17,002 INFO L87 Difference]: Start difference. First operand 20643 states and 79288 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:48:17,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 15:48:17,237 INFO L93 Difference]: Finished difference Result 17565 states and 66895 transitions.
[2021-06-01 15:48:17,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2021-06-01 15:48:17,237 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94
[2021-06-01 15:48:17,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 15:48:17,254 INFO L225 Difference]: With dead ends: 17565
[2021-06-01 15:48:17,255 INFO L226 Difference]: Without dead ends: 7486
[2021-06-01 15:48:17,255 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 117.5ms TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272
[2021-06-01 15:48:17,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7486 states.
[2021-06-01 15:48:17,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7486 to 7486.
[2021-06-01 15:48:17,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7486 states, 7485 states have (on average 3.782231128924516) internal successors, (28310), 7485 states have internal predecessors, (28310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:48:17,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7486 states to 7486 states and 28310 transitions.
[2021-06-01 15:48:17,373 INFO L78 Accepts]: Start accepts. Automaton has 7486 states and 28310 transitions. Word has length 94
[2021-06-01 15:48:17,373 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 15:48:17,373 INFO L482 AbstractCegarLoop]: Abstraction has 7486 states and 28310 transitions.
[2021-06-01 15:48:17,373 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:48:17,374 INFO L276 IsEmpty]: Start isEmpty. Operand 7486 states and 28310 transitions.
[2021-06-01 15:48:17,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2021-06-01 15:48:17,385 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 15:48:17,385 INFO L554 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 15:48:17,385 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2021-06-01 15:48:17,385 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 15:48:17,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 15:48:17,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1466963612, now seen corresponding path program 1 times
[2021-06-01 15:48:17,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 15:48:17,385 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625968211]
[2021-06-01 15:48:17,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 15:48:17,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 15:48:17,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 15:48:17,484 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 15:48:17,485 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625968211]
[2021-06-01 15:48:17,485 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625968211] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 15:48:17,485 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 15:48:17,485 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-06-01 15:48:17,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120110011]
[2021-06-01 15:48:17,485 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-06-01 15:48:17,485 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 15:48:17,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-06-01 15:48:17,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2021-06-01 15:48:17,486 INFO L87 Difference]: Start difference. First operand 7486 states and 28310 transitions. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:48:17,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 15:48:17,602 INFO L93 Difference]: Finished difference Result 10096 states and 38210 transitions.
[2021-06-01 15:48:17,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2021-06-01 15:48:17,603 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99
[2021-06-01 15:48:17,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 15:48:17,613 INFO L225 Difference]: With dead ends: 10096
[2021-06-01 15:48:17,614 INFO L226 Difference]: Without dead ends: 4444
[2021-06-01 15:48:17,614 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 76.9ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110
[2021-06-01 15:48:17,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4444 states.
[2021-06-01 15:48:17,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4444 to 4444.
[2021-06-01 15:48:17,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4444 states, 4443 states have (on average 3.696601395453522) internal successors, (16424), 4443 states have internal predecessors, (16424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:48:17,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4444 states to 4444 states and 16424 transitions.
[2021-06-01 15:48:17,680 INFO L78 Accepts]: Start accepts. Automaton has 4444 states and 16424 transitions. Word has length 99
[2021-06-01 15:48:17,680 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 15:48:17,680 INFO L482 AbstractCegarLoop]: Abstraction has 4444 states and 16424 transitions.
[2021-06-01 15:48:17,681 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:48:17,681 INFO L276 IsEmpty]: Start isEmpty. Operand 4444 states and 16424 transitions.
[2021-06-01 15:48:17,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2021-06-01 15:48:17,686 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 15:48:17,687 INFO L554 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 15:48:17,687 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2021-06-01 15:48:17,687 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 15:48:17,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 15:48:17,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1069134434, now seen corresponding path program 2 times
[2021-06-01 15:48:17,687 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 15:48:17,687 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944810694]
[2021-06-01 15:48:17,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 15:48:17,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 15:48:18,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 15:48:18,060 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 15:48:18,060 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944810694]
[2021-06-01 15:48:18,060 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944810694] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 15:48:18,060 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 15:48:18,060 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2021-06-01 15:48:18,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4510911]
[2021-06-01 15:48:18,060 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states
[2021-06-01 15:48:18,061 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 15:48:18,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2021-06-01 15:48:18,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210
[2021-06-01 15:48:18,061 INFO L87 Difference]: Start difference. First operand 4444 states and 16424 transitions. Second operand has 15 states, 15 states have (on average 6.6) internal successors, (99), 15 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:48:18,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 15:48:18,405 INFO L93 Difference]: Finished difference Result 6454 states and 23914 transitions.
[2021-06-01 15:48:18,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2021-06-01 15:48:18,405 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.6) internal successors, (99), 15 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99
[2021-06-01 15:48:18,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 15:48:18,411 INFO L225 Difference]: With dead ends: 6454
[2021-06-01 15:48:18,412 INFO L226 Difference]: Without dead ends: 3060
[2021-06-01 15:48:18,412 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 315.1ms TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306
[2021-06-01 15:48:18,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3060 states.
[2021-06-01 15:48:18,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3060 to 3060.
[2021-06-01 15:48:18,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3060 states, 3059 states have (on average 3.5697940503432495) internal successors, (10920), 3059 states have internal predecessors, (10920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:48:18,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3060 states to 3060 states and 10920 transitions.
[2021-06-01 15:48:18,462 INFO L78 Accepts]: Start accepts. Automaton has 3060 states and 10920 transitions. Word has length 99
[2021-06-01 15:48:18,462 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 15:48:18,462 INFO L482 AbstractCegarLoop]: Abstraction has 3060 states and 10920 transitions.
[2021-06-01 15:48:18,462 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 6.6) internal successors, (99), 15 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:48:18,462 INFO L276 IsEmpty]: Start isEmpty. Operand 3060 states and 10920 transitions.
[2021-06-01 15:48:18,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2021-06-01 15:48:18,466 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 15:48:18,466 INFO L554 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 15:48:18,466 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2021-06-01 15:48:18,467 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 15:48:18,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 15:48:18,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1580220514, now seen corresponding path program 3 times
[2021-06-01 15:48:18,467 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 15:48:18,467 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29899378]
[2021-06-01 15:48:18,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 15:48:18,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-06-01 15:48:18,506 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-06-01 15:48:18,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-06-01 15:48:18,550 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-06-01 15:48:18,591 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-06-01 15:48:18,593 INFO L655 BasicCegarLoop]: Counterexample might be feasible
[2021-06-01 15:48:18,593 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2021-06-01 15:48:18,593 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (3/3)
[2021-06-01 15:48:18,594 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2021-06-01 15:48:18,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.06 03:48:18 BasicIcfg
[2021-06-01 15:48:18,749 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2021-06-01 15:48:18,750 INFO L168 Benchmark]: Toolchain (without parser) took 126007.87 ms. Allocated memory was 339.7 MB in the beginning and 14.7 GB in the end (delta: 14.4 GB). Free memory was 302.1 MB in the beginning and 8.5 GB in the end (delta: -8.2 GB). Peak memory consumption was 6.2 GB. Max. memory is 16.0 GB.
[2021-06-01 15:48:18,750 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 339.7 MB. Free memory is still 320.5 MB. There was no memory consumed. Max. memory is 16.0 GB.
[2021-06-01 15:48:18,750 INFO L168 Benchmark]: CACSL2BoogieTranslator took 527.79 ms. Allocated memory is still 339.7 MB. Free memory was 302.0 MB in the beginning and 298.2 MB in the end (delta: 3.9 MB). Peak memory consumption was 7.0 MB. Max. memory is 16.0 GB.
[2021-06-01 15:48:18,751 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.74 ms. Allocated memory is still 339.7 MB. Free memory was 298.2 MB in the beginning and 295.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
[2021-06-01 15:48:18,751 INFO L168 Benchmark]: Boogie Preprocessor took 32.46 ms. Allocated memory is still 339.7 MB. Free memory was 295.0 MB in the beginning and 292.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
[2021-06-01 15:48:18,751 INFO L168 Benchmark]: RCFGBuilder took 1970.57 ms. Allocated memory is still 339.7 MB. Free memory was 292.9 MB in the beginning and 226.3 MB in the end (delta: 66.6 MB). Peak memory consumption was 144.2 MB. Max. memory is 16.0 GB.
[2021-06-01 15:48:18,751 INFO L168 Benchmark]: TraceAbstraction took 123423.58 ms. Allocated memory was 339.7 MB in the beginning and 14.7 GB in the end (delta: 14.4 GB). Free memory was 226.3 MB in the beginning and 8.5 GB in the end (delta: -8.3 GB). Peak memory consumption was 6.1 GB. Max. memory is 16.0 GB.
[2021-06-01 15:48:18,752 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.15 ms. Allocated memory is still 339.7 MB. Free memory is still 320.5 MB. There was no memory consumed. Max. memory is 16.0 GB.
* CACSL2BoogieTranslator took 527.79 ms. Allocated memory is still 339.7 MB. Free memory was 302.0 MB in the beginning and 298.2 MB in the end (delta: 3.9 MB). Peak memory consumption was 7.0 MB. Max. memory is 16.0 GB.
* Boogie Procedure Inliner took 47.74 ms. Allocated memory is still 339.7 MB. Free memory was 298.2 MB in the beginning and 295.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
* Boogie Preprocessor took 32.46 ms. Allocated memory is still 339.7 MB. Free memory was 295.0 MB in the beginning and 292.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
* RCFGBuilder took 1970.57 ms. Allocated memory is still 339.7 MB. Free memory was 292.9 MB in the beginning and 226.3 MB in the end (delta: 66.6 MB). Peak memory consumption was 144.2 MB. Max. memory is 16.0 GB.
* TraceAbstraction took 123423.58 ms. Allocated memory was 339.7 MB in the beginning and 14.7 GB in the end (delta: 14.4 GB). Free memory was 226.3 MB in the beginning and 8.5 GB in the end (delta: -8.3 GB). Peak memory consumption was 6.1 GB. Max. memory is 16.0 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- PositiveResult [Line: 18]: call to reach_error is unreachable
For all program executions holds that call to reach_error is unreachable at this location
- CounterExampleResult [Line: 18]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L710] 0 int __unbuffered_cnt = 0;
VAL [__unbuffered_cnt=0]
[L712] 0 int __unbuffered_p0_EAX = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0]
[L714] 0 int __unbuffered_p3_EAX = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0]
[L716] 0 int __unbuffered_p3_EBX = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0]
[L718] 0 int a = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0]
[L719] 0 _Bool main$tmp_guard0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0]
[L720] 0 _Bool main$tmp_guard1;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0]
[L722] 0 int x = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0]
[L724] 0 int y = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0]
[L725] 0 _Bool y$flush_delayed;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0]
[L726] 0 int y$mem_tmp;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0]
[L727] 0 _Bool y$r_buff0_thd0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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]
[L728] 0 _Bool y$r_buff0_thd1;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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]
[L729] 0 _Bool y$r_buff0_thd2;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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]
[L730] 0 _Bool y$r_buff0_thd3;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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]
[L731] 0 _Bool y$r_buff0_thd4;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0]
[L732] 0 _Bool y$r_buff1_thd0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0]
[L733] 0 _Bool y$r_buff1_thd1;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0]
[L734] 0 _Bool y$r_buff1_thd2;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0]
[L735] 0 _Bool y$r_buff1_thd3;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0]
[L736] 0 _Bool y$r_buff1_thd4;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0]
[L737] 0 _Bool y$read_delayed;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0]
[L738] 0 int *y$read_delayed_var;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}]
[L739] 0 int y$w_buff0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0]
[L740] 0 _Bool y$w_buff0_used;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0]
[L741] 0 int y$w_buff1;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0]
[L742] 0 _Bool y$w_buff1_used;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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]
[L744] 0 int z = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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]
[L745] 0 _Bool weak$$choice0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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$$choice2;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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]
[L846] 0 pthread_t t789;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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]
[L847] FCALL, FORK 0 pthread_create(&t789, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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]
[L848] 0 pthread_t t790;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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]
[L849] FCALL, FORK 0 pthread_create(&t790, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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]
[L850] 0 pthread_t t791;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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]
[L851] FCALL, FORK 0 pthread_create(&t791, ((void *)0), P2, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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]
[L852] 0 pthread_t t792;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] FCALL, FORK 0 pthread_create(&t792, ((void *)0), P3, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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]
[L785] 3 y$w_buff1 = y$w_buff0
[L786] 3 y$w_buff0 = 2
[L787] 3 y$w_buff1_used = y$w_buff0_used
[L788] 3 y$w_buff0_used = (_Bool)1
[L18] COND FALSE 3 !(!expression)
[L790] 3 y$r_buff1_thd0 = y$r_buff0_thd0
[L791] 3 y$r_buff1_thd1 = y$r_buff0_thd1
[L792] 3 y$r_buff1_thd2 = y$r_buff0_thd2
[L793] 3 y$r_buff1_thd3 = y$r_buff0_thd3
[L794] 3 y$r_buff1_thd4 = y$r_buff0_thd4
[L795] 3 y$r_buff0_thd3 = (_Bool)1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L798] 3 z = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L815] 4 z = 2
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L818] 4 __unbuffered_p3_EAX = z
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L821] 4 __unbuffered_p3_EBX = a
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L750] 1 a = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L753] 1 __unbuffered_p0_EAX = x
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L765] 2 x = 1
VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L768] 2 y = 1
VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L801] 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)
[L801] 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)
[L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L803] 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
[L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L805] 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
[L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L771] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y
[L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L824] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y)
[L824] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y
[L824] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y)
[L824] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y)
[L825] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used
[L825] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used
[L826] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used
[L826] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used
[L827] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4
[L827] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4
[L828] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4
[L828] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4
[L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4
VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L3] COND FALSE 0 !(!cond)
VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L859] 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)
[L859] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y
[L859] 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)
[L859] 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)
[L860] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L860] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L861] 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
[L862] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L862] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L863] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
[L863] 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
[L866] 0 weak$$choice0 = __VERIFIER_nondet_bool()
[L867] 0 weak$$choice2 = __VERIFIER_nondet_bool()
[L868] 0 y$flush_delayed = weak$$choice2
[L869] 0 y$mem_tmp = y
[L870] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L870] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L871] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L871] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)
[L871] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L871] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L872] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L872] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)
[L872] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L872] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L873] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L873] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)
[L873] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L873] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L874] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L874] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L874] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L874] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L875] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L875] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)
[L875] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L875] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L876] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L876] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L876] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L876] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L877] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0)
[L878] EXPR 0 y$flush_delayed ? y$mem_tmp : y
[L878] 0 y = y$flush_delayed ? y$mem_tmp : y
[L879] 0 y$flush_delayed = (_Bool)0
VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L18] COND TRUE 0 !expression
VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L18] 0 reach_error()
VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2]
- StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P2 with 1 thread instances
CFG has 9 procedures, 164 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 29762.7ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 1311.4ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 28447.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=135557occurred in iteration=0, InterpolantAutomatonStates: 0, 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: No data available, ReuseStatistics: No data available
- StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P2Thread1of1ForFork2 with 1 thread instances
CFG has 9 procedures, 164 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 28929.8ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 467.2ms, AutomataDifference: 1781.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 26295.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 115 SDtfs, 51 SDslu, 86 SDs, 0 SdLazy, 11 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 28.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=135557occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 7.4ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 10.8ms SsaConstructionTime, 70.8ms SatisfiabilityAnalysisTime, 167.5ms InterpolantComputationTime, 60 NumberOfCodeBlocks, 60 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 59 ConstructedInterpolants, 0 QuantifiedInterpolants, 115 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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
- StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances
CFG has 9 procedures, 164 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 64449.5ms, OverallIterations: 15, TraceHistogramMax: 1, EmptinessCheckTime: 1080.2ms, AutomataDifference: 14371.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 25653.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2492 SDtfs, 4513 SDslu, 9680 SDs, 0 SdLazy, 998 SolverSat, 260 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1038.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 206 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 2242.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=135557occurred in iteration=0, InterpolantAutomatonStates: 155, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 20408.1ms AutomataMinimizationTime, 14 MinimizatonAttempts, 10456 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 48.2ms SsaConstructionTime, 581.5ms SatisfiabilityAnalysisTime, 2049.5ms InterpolantComputationTime, 1331 NumberOfCodeBlocks, 1331 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1218 ConstructedInterpolants, 0 QuantifiedInterpolants, 6850 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...