/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Delay.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-98196c323137eee61a7c1131837b356358d783d4-98196c3 [2021-06-16 15:41:06,258 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-16 15:41:06,261 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-16 15:41:06,298 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-16 15:41:06,298 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-16 15:41:06,300 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-16 15:41:06,301 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-16 15:41:06,303 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-16 15:41:06,304 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-16 15:41:06,305 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-16 15:41:06,306 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-16 15:41:06,307 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-16 15:41:06,307 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-16 15:41:06,308 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-16 15:41:06,331 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-16 15:41:06,332 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-16 15:41:06,333 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-16 15:41:06,333 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-16 15:41:06,335 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-16 15:41:06,336 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-16 15:41:06,337 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-16 15:41:06,342 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-16 15:41:06,343 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-16 15:41:06,343 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-16 15:41:06,346 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-16 15:41:06,346 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-16 15:41:06,346 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-16 15:41:06,347 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-16 15:41:06,348 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-16 15:41:06,348 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-16 15:41:06,349 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-16 15:41:06,349 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-16 15:41:06,350 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-16 15:41:06,351 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-16 15:41:06,352 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-16 15:41:06,352 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-16 15:41:06,352 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-16 15:41:06,353 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-16 15:41:06,353 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-16 15:41:06,354 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-16 15:41:06,354 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-16 15:41:06,363 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-Delay.epf [2021-06-16 15:41:06,398 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-16 15:41:06,399 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-16 15:41:06,401 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-16 15:41:06,402 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-16 15:41:06,402 INFO L138 SettingsManager]: * Use SBE=true [2021-06-16 15:41:06,402 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-16 15:41:06,402 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-16 15:41:06,402 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-16 15:41:06,402 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-16 15:41:06,403 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-16 15:41:06,403 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-16 15:41:06,404 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-16 15:41:06,404 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-16 15:41:06,404 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-16 15:41:06,404 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-16 15:41:06,404 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-16 15:41:06,404 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-16 15:41:06,405 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-16 15:41:06,405 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-16 15:41:06,405 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-16 15:41:06,405 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-16 15:41:06,405 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-16 15:41:06,406 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-16 15:41:06,406 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-16 15:41:06,406 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-16 15:41:06,406 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-16 15:41:06,406 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-16 15:41:06,406 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-16 15:41:06,407 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-16 15:41:06,407 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_DELAY_SET [2021-06-16 15:41:06,407 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-16 15:41:06,758 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-16 15:41:06,776 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-16 15:41:06,779 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-16 15:41:06,780 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-16 15:41:06,780 INFO L275 PluginConnector]: CDTParser initialized [2021-06-16 15:41:06,781 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.opt.i [2021-06-16 15:41:06,857 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9f805913/8ed3a8d82cb1411e9498fb83d155e7f6/FLAG92bbe102c [2021-06-16 15:41:07,309 INFO L306 CDTParser]: Found 1 translation units. [2021-06-16 15:41:07,309 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_pso.opt.i [2021-06-16 15:41:07,330 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9f805913/8ed3a8d82cb1411e9498fb83d155e7f6/FLAG92bbe102c [2021-06-16 15:41:07,655 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9f805913/8ed3a8d82cb1411e9498fb83d155e7f6 [2021-06-16 15:41:07,658 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-16 15:41:07,659 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-16 15:41:07,665 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-16 15:41:07,665 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-16 15:41:07,668 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-16 15:41:07,669 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.06 03:41:07" (1/1) ... [2021-06-16 15:41:07,672 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@737cddee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:41:07, skipping insertion in model container [2021-06-16 15:41:07,672 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.06 03:41:07" (1/1) ... [2021-06-16 15:41:07,678 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-16 15:41:07,738 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-16 15:41:07,871 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/mix054_pso.opt.i[948,961] [2021-06-16 15:41:08,059 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-16 15:41:08,067 INFO L203 MainTranslator]: Completed pre-run [2021-06-16 15:41:08,078 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/mix054_pso.opt.i[948,961] [2021-06-16 15:41:08,139 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-16 15:41:08,211 INFO L208 MainTranslator]: Completed translation [2021-06-16 15:41:08,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:41:08 WrapperNode [2021-06-16 15:41:08,214 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-16 15:41:08,215 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-16 15:41:08,216 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-16 15:41:08,216 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-16 15:41:08,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:41:08" (1/1) ... [2021-06-16 15:41:08,238 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:41:08" (1/1) ... [2021-06-16 15:41:08,278 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-16 15:41:08,279 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-16 15:41:08,279 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-16 15:41:08,279 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-16 15:41:08,286 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:41:08" (1/1) ... [2021-06-16 15:41:08,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:41:08" (1/1) ... [2021-06-16 15:41:08,291 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:41:08" (1/1) ... [2021-06-16 15:41:08,291 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:41:08" (1/1) ... [2021-06-16 15:41:08,298 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:41:08" (1/1) ... [2021-06-16 15:41:08,301 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:41:08" (1/1) ... [2021-06-16 15:41:08,304 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:41:08" (1/1) ... [2021-06-16 15:41:08,308 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-16 15:41:08,309 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-16 15:41:08,309 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-16 15:41:08,309 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-16 15:41:08,310 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:41:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-16 15:41:08,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-16 15:41:08,390 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-16 15:41:08,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-16 15:41:08,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-16 15:41:08,391 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-16 15:41:08,391 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-16 15:41:08,391 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-16 15:41:08,391 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-16 15:41:08,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-16 15:41:08,391 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-16 15:41:08,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-16 15:41:08,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-16 15:41:08,393 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-16 15:41:10,097 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-16 15:41:10,098 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-16 15:41:10,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.06 03:41:10 BoogieIcfgContainer [2021-06-16 15:41:10,101 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-16 15:41:10,102 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-16 15:41:10,102 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-16 15:41:10,105 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-16 15:41:10,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.06 03:41:07" (1/3) ... [2021-06-16 15:41:10,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@740a2aad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.06 03:41:10, skipping insertion in model container [2021-06-16 15:41:10,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:41:08" (2/3) ... [2021-06-16 15:41:10,107 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@740a2aad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.06 03:41:10, skipping insertion in model container [2021-06-16 15:41:10,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.06 03:41:10" (3/3) ... [2021-06-16 15:41:10,109 INFO L111 eAbstractionObserver]: Analyzing ICFG mix054_pso.opt.i [2021-06-16 15:41:10,118 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-16 15:41:10,118 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-16 15:41:10,119 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-16 15:41:10,119 INFO L470 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-16 15:41:10,149 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,150 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,150 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,150 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,150 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,150 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,150 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,151 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,151 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,151 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,151 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,151 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,151 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,151 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,151 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,152 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,152 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,152 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,152 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,152 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,152 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,152 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,153 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,153 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,153 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,154 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,155 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,155 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,155 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,155 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,155 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,155 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,155 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,155 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,156 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,156 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,156 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,157 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,157 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,157 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,158 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,158 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,158 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,158 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,158 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,158 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,159 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,159 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,159 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,159 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,159 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,159 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,159 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,160 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,160 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,160 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,160 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,160 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,160 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,161 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,163 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,163 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,163 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,163 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,164 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,164 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,164 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,164 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,164 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,164 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,164 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,164 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,166 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,166 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,167 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,167 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,168 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,168 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,168 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,168 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,168 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,168 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:41:10,169 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-16 15:41:10,189 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-16 15:41:10,217 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-16 15:41:10,217 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-16 15:41:10,217 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-16 15:41:10,217 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-16 15:41:10,217 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-16 15:41:10,218 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-16 15:41:10,218 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-16 15:41:10,219 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P1======== [2021-06-16 15:41:10,739 INFO L276 IsEmpty]: Start isEmpty. Operand has 1892 states, 1648 states have (on average 2.0442961165048543) internal successors, (3369), 1891 states have internal predecessors, (3369), 0 states have call successors, (0), 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-16 15:41:10,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-16 15:41:10,758 INFO L301 ceAbstractionStarter]: Result for error location P1 was SAFE (1/3) [2021-06-16 15:41:10,760 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-16 15:41:10,761 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-16 15:41:10,761 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-16 15:41:10,761 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-16 15:41:10,762 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-16 15:41:10,762 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-16 15:41:10,762 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-16 15:41:10,762 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-16 15:41:10,762 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P1Thread1of1ForFork0======== [2021-06-16 15:41:11,184 INFO L276 IsEmpty]: Start isEmpty. Operand has 1892 states, 1648 states have (on average 2.0442961165048543) internal successors, (3369), 1891 states have internal predecessors, (3369), 0 states have call successors, (0), 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-16 15:41:11,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-06-16 15:41:11,185 INFO L464 BasicCegarLoop]: Found error trace [2021-06-16 15:41:11,186 INFO L472 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] [2021-06-16 15:41:11,187 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 15:41:11,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 15:41:11,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1107007031, now seen corresponding path program 1 times [2021-06-16 15:41:11,201 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 15:41:11,201 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981810187] [2021-06-16 15:41:11,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 15:41:11,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 15:41:11,421 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:41:11,422 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:41:11,422 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:41:11,423 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-16 15:41:11,433 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-16 15:41:11,433 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 15:41:11,434 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981810187] [2021-06-16 15:41:11,435 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981810187] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 15:41:11,435 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 15:41:11,435 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-16 15:41:11,436 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366352874] [2021-06-16 15:41:11,438 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-16 15:41:11,439 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 15:41:11,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-16 15:41:11,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-16 15:41:11,456 INFO L87 Difference]: Start difference. First operand has 1892 states, 1648 states have (on average 2.0442961165048543) internal successors, (3369), 1891 states have internal predecessors, (3369), 0 states have call successors, (0), 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 22.5) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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-16 15:41:11,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-16 15:41:11,517 INFO L93 Difference]: Finished difference Result 1628 states and 2729 transitions. [2021-06-16 15:41:11,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 15:41:11,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2021-06-16 15:41:11,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-16 15:41:11,524 INFO L225 Difference]: With dead ends: 1628 [2021-06-16 15:41:11,524 INFO L226 Difference]: Without dead ends: 0 [2021-06-16 15:41:11,525 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-16 15:41:11,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-16 15:41:11,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-16 15:41:11,545 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-16 15:41:11,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-16 15:41:11,546 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2021-06-16 15:41:11,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-16 15:41:11,546 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-16 15:41:11,546 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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-16 15:41:11,547 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-16 15:41:11,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-16 15:41:11,547 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-16 15:41:11,547 INFO L301 ceAbstractionStarter]: Result for error location P1Thread1of1ForFork0 was SAFE (2/3) [2021-06-16 15:41:11,548 INFO L255 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-06-16 15:41:11,549 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-16 15:41:11,549 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-16 15:41:11,550 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-16 15:41:11,550 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-16 15:41:11,550 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-16 15:41:11,550 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-16 15:41:11,550 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-16 15:41:11,550 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-16 15:41:11,904 INFO L276 IsEmpty]: Start isEmpty. Operand has 1892 states, 1648 states have (on average 2.0442961165048543) internal successors, (3369), 1891 states have internal predecessors, (3369), 0 states have call successors, (0), 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-16 15:41:11,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-06-16 15:41:11,907 INFO L464 BasicCegarLoop]: Found error trace [2021-06-16 15:41:11,907 INFO L472 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] [2021-06-16 15:41:11,907 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 15:41:11,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 15:41:11,908 INFO L82 PathProgramCache]: Analyzing trace with hash 850422234, now seen corresponding path program 1 times [2021-06-16 15:41:11,908 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 15:41:11,908 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488523300] [2021-06-16 15:41:11,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 15:41:11,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 15:41:12,143 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:41:12,143 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:41:12,145 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:41:12,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-16 15:41:12,155 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:41:12,155 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-16 15:41:12,162 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:41:12,163 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-16 15:41:12,184 INFO L142 QuantifierPusher]: treesize reduction 14, result has 48.1 percent of original size [2021-06-16 15:41:12,185 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-16 15:41:12,197 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-16 15:41:12,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-16 15:41:12,215 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:41:12,215 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:41:12,227 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:41:12,228 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:41:12,238 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:41:12,238 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:41:12,239 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-16 15:41:12,239 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 15:41:12,239 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488523300] [2021-06-16 15:41:12,240 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488523300] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 15:41:12,240 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 15:41:12,240 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-16 15:41:12,240 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38069559] [2021-06-16 15:41:12,273 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-16 15:41:12,273 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 15:41:12,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-16 15:41:12,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-16 15:41:12,277 INFO L87 Difference]: Start difference. First operand has 1892 states, 1648 states have (on average 2.0442961165048543) internal successors, (3369), 1891 states have internal predecessors, (3369), 0 states have call successors, (0), 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 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 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-16 15:41:12,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-16 15:41:12,541 INFO L93 Difference]: Finished difference Result 2609 states and 4666 transitions. [2021-06-16 15:41:12,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-16 15:41:12,542 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2021-06-16 15:41:12,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-16 15:41:12,552 INFO L225 Difference]: With dead ends: 2609 [2021-06-16 15:41:12,553 INFO L226 Difference]: Without dead ends: 758 [2021-06-16 15:41:12,553 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 173.8ms TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2021-06-16 15:41:12,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2021-06-16 15:41:12,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 749. [2021-06-16 15:41:12,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 749 states, 738 states have (on average 1.886178861788618) internal successors, (1392), 748 states have internal predecessors, (1392), 0 states have call successors, (0), 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-16 15:41:12,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1392 transitions. [2021-06-16 15:41:12,605 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1392 transitions. Word has length 57 [2021-06-16 15:41:12,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-16 15:41:12,605 INFO L482 AbstractCegarLoop]: Abstraction has 749 states and 1392 transitions. [2021-06-16 15:41:12,606 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 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-16 15:41:12,606 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1392 transitions. [2021-06-16 15:41:12,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-06-16 15:41:12,608 INFO L464 BasicCegarLoop]: Found error trace [2021-06-16 15:41:12,608 INFO L472 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] [2021-06-16 15:41:12,608 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-16 15:41:12,608 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 15:41:12,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 15:41:12,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1940664615, now seen corresponding path program 1 times [2021-06-16 15:41:12,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 15:41:12,609 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284294204] [2021-06-16 15:41:12,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 15:41:12,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 15:41:12,670 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:41:12,671 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:41:12,672 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:41:12,675 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-16 15:41:12,680 INFO L142 QuantifierPusher]: treesize reduction 2, result has 94.7 percent of original size [2021-06-16 15:41:12,681 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-06-16 15:41:12,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:41:12,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:41:12,683 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-16 15:41:12,684 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 15:41:12,685 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284294204] [2021-06-16 15:41:12,685 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284294204] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 15:41:12,685 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 15:41:12,685 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-16 15:41:12,686 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756797407] [2021-06-16 15:41:12,687 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-16 15:41:12,687 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 15:41:12,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-16 15:41:12,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-16 15:41:12,688 INFO L87 Difference]: Start difference. First operand 749 states and 1392 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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-16 15:41:12,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-16 15:41:12,716 INFO L93 Difference]: Finished difference Result 670 states and 1221 transitions. [2021-06-16 15:41:12,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 15:41:12,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2021-06-16 15:41:12,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-16 15:41:12,720 INFO L225 Difference]: With dead ends: 670 [2021-06-16 15:41:12,720 INFO L226 Difference]: Without dead ends: 670 [2021-06-16 15:41:12,721 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-16 15:41:12,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2021-06-16 15:41:12,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 670. [2021-06-16 15:41:12,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 662 states have (on average 1.8444108761329305) internal successors, (1221), 669 states have internal predecessors, (1221), 0 states have call successors, (0), 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-16 15:41:12,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1221 transitions. [2021-06-16 15:41:12,752 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1221 transitions. Word has length 59 [2021-06-16 15:41:12,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-16 15:41:12,753 INFO L482 AbstractCegarLoop]: Abstraction has 670 states and 1221 transitions. [2021-06-16 15:41:12,753 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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-16 15:41:12,754 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1221 transitions. [2021-06-16 15:41:12,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-06-16 15:41:12,757 INFO L464 BasicCegarLoop]: Found error trace [2021-06-16 15:41:12,757 INFO L472 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] [2021-06-16 15:41:12,757 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-16 15:41:12,757 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 15:41:12,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 15:41:12,758 INFO L82 PathProgramCache]: Analyzing trace with hash -197854280, now seen corresponding path program 1 times [2021-06-16 15:41:12,758 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 15:41:12,758 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150508771] [2021-06-16 15:41:12,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 15:41:12,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 15:41:12,941 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:41:12,942 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:41:12,942 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:41:12,943 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-16 15:41:12,947 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:41:12,947 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-16 15:41:12,952 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:41:12,953 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-16 15:41:12,966 INFO L142 QuantifierPusher]: treesize reduction 26, result has 59.4 percent of original size [2021-06-16 15:41:12,969 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-06-16 15:41:12,992 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-16 15:41:12,993 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-16 15:41:13,009 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:41:13,010 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:41:13,018 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:41:13,019 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:41:13,028 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:41:13,029 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:41:13,029 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-16 15:41:13,029 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 15:41:13,031 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150508771] [2021-06-16 15:41:13,032 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150508771] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 15:41:13,032 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 15:41:13,032 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-16 15:41:13,032 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339494147] [2021-06-16 15:41:13,032 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-16 15:41:13,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 15:41:13,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-16 15:41:13,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-06-16 15:41:13,034 INFO L87 Difference]: Start difference. First operand 670 states and 1221 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 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-16 15:41:13,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-16 15:41:13,392 INFO L93 Difference]: Finished difference Result 812 states and 1531 transitions. [2021-06-16 15:41:13,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-16 15:41:13,392 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2021-06-16 15:41:13,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-16 15:41:13,395 INFO L225 Difference]: With dead ends: 812 [2021-06-16 15:41:13,395 INFO L226 Difference]: Without dead ends: 684 [2021-06-16 15:41:13,396 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 258.8ms TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2021-06-16 15:41:13,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2021-06-16 15:41:13,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 679. [2021-06-16 15:41:13,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 671 states have (on average 1.8435171385991058) internal successors, (1237), 678 states have internal predecessors, (1237), 0 states have call successors, (0), 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-16 15:41:13,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 1237 transitions. [2021-06-16 15:41:13,410 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 1237 transitions. Word has length 59 [2021-06-16 15:41:13,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-16 15:41:13,410 INFO L482 AbstractCegarLoop]: Abstraction has 679 states and 1237 transitions. [2021-06-16 15:41:13,410 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 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-16 15:41:13,411 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 1237 transitions. [2021-06-16 15:41:13,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-06-16 15:41:13,412 INFO L464 BasicCegarLoop]: Found error trace [2021-06-16 15:41:13,412 INFO L472 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] [2021-06-16 15:41:13,412 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-16 15:41:13,412 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 15:41:13,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 15:41:13,413 INFO L82 PathProgramCache]: Analyzing trace with hash -138801092, now seen corresponding path program 2 times [2021-06-16 15:41:13,413 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 15:41:13,413 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595862737] [2021-06-16 15:41:13,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 15:41:13,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 15:41:13,511 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:41:13,512 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:41:13,512 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:41:13,512 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-16 15:41:13,515 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:41:13,516 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-16 15:41:13,522 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:41:13,522 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-16 15:41:13,535 INFO L142 QuantifierPusher]: treesize reduction 48, result has 35.1 percent of original size [2021-06-16 15:41:13,536 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-06-16 15:41:13,546 INFO L142 QuantifierPusher]: treesize reduction 38, result has 61.2 percent of original size [2021-06-16 15:41:13,547 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 60 [2021-06-16 15:41:13,577 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-16 15:41:13,578 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-16 15:41:13,594 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:41:13,595 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:41:13,603 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:41:13,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:41:13,612 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:41:13,612 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:41:13,613 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-16 15:41:13,613 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 15:41:13,613 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595862737] [2021-06-16 15:41:13,613 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595862737] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 15:41:13,613 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 15:41:13,614 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-16 15:41:13,614 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449631435] [2021-06-16 15:41:13,614 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-16 15:41:13,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 15:41:13,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-16 15:41:13,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-06-16 15:41:13,615 INFO L87 Difference]: Start difference. First operand 679 states and 1237 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 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-16 15:41:13,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-16 15:41:13,781 INFO L93 Difference]: Finished difference Result 771 states and 1429 transitions. [2021-06-16 15:41:13,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-16 15:41:13,781 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2021-06-16 15:41:13,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-16 15:41:13,784 INFO L225 Difference]: With dead ends: 771 [2021-06-16 15:41:13,784 INFO L226 Difference]: Without dead ends: 643 [2021-06-16 15:41:13,784 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 140.9ms TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-06-16 15:41:13,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2021-06-16 15:41:13,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 641. [2021-06-16 15:41:13,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 633 states have (on average 1.8088467614533965) internal successors, (1145), 640 states have internal predecessors, (1145), 0 states have call successors, (0), 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-16 15:41:13,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 1145 transitions. [2021-06-16 15:41:13,799 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 1145 transitions. Word has length 59 [2021-06-16 15:41:13,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-16 15:41:13,799 INFO L482 AbstractCegarLoop]: Abstraction has 641 states and 1145 transitions. [2021-06-16 15:41:13,800 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 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-16 15:41:13,800 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 1145 transitions. [2021-06-16 15:41:13,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-06-16 15:41:13,801 INFO L464 BasicCegarLoop]: Found error trace [2021-06-16 15:41:13,802 INFO L472 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-16 15:41:13,802 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-16 15:41:13,802 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 15:41:13,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 15:41:13,803 INFO L82 PathProgramCache]: Analyzing trace with hash 947288341, now seen corresponding path program 1 times [2021-06-16 15:41:13,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 15:41:13,803 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887551744] [2021-06-16 15:41:13,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 15:41:13,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 15:41:13,905 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:41:13,905 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:41:13,906 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:41:13,906 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-16 15:41:13,908 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:41:13,912 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-16 15:41:13,917 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:41:13,917 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-16 15:41:13,925 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-16 15:41:13,926 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-16 15:41:13,941 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:41:13,941 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:41:13,950 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:41:13,950 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:41:13,958 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:41:13,958 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:41:13,959 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-16 15:41:13,959 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 15:41:13,959 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887551744] [2021-06-16 15:41:13,959 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887551744] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 15:41:13,959 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 15:41:13,959 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-16 15:41:13,961 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131146450] [2021-06-16 15:41:13,961 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-16 15:41:13,961 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 15:41:13,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-16 15:41:13,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-16 15:41:13,962 INFO L87 Difference]: Start difference. First operand 641 states and 1145 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 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-16 15:41:14,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-16 15:41:14,138 INFO L93 Difference]: Finished difference Result 763 states and 1404 transitions. [2021-06-16 15:41:14,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-16 15:41:14,139 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 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-16 15:41:14,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-16 15:41:14,141 INFO L225 Difference]: With dead ends: 763 [2021-06-16 15:41:14,141 INFO L226 Difference]: Without dead ends: 643 [2021-06-16 15:41:14,142 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 106.8ms TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-06-16 15:41:14,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2021-06-16 15:41:14,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 642. [2021-06-16 15:41:14,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 634 states have (on average 1.8091482649842272) internal successors, (1147), 641 states have internal predecessors, (1147), 0 states have call successors, (0), 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-16 15:41:14,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 1147 transitions. [2021-06-16 15:41:14,155 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 1147 transitions. Word has length 60 [2021-06-16 15:41:14,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-16 15:41:14,156 INFO L482 AbstractCegarLoop]: Abstraction has 642 states and 1147 transitions. [2021-06-16 15:41:14,156 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 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-16 15:41:14,156 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 1147 transitions. [2021-06-16 15:41:14,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-06-16 15:41:14,157 INFO L464 BasicCegarLoop]: Found error trace [2021-06-16 15:41:14,157 INFO L472 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-16 15:41:14,157 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-16 15:41:14,157 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 15:41:14,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 15:41:14,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1451624423, now seen corresponding path program 2 times [2021-06-16 15:41:14,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 15:41:14,158 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488404628] [2021-06-16 15:41:14,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 15:41:14,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 15:41:14,241 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:41:14,241 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:41:14,242 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:41:14,242 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-16 15:41:14,245 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:41:14,246 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-16 15:41:14,252 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:41:14,252 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-16 15:41:14,262 INFO L142 QuantifierPusher]: treesize reduction 37, result has 48.6 percent of original size [2021-06-16 15:41:14,262 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-06-16 15:41:14,281 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-16 15:41:14,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-16 15:41:14,297 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:41:14,298 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:41:14,305 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:41:14,306 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:41:14,314 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:41:14,315 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:41:14,315 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-16 15:41:14,315 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 15:41:14,315 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488404628] [2021-06-16 15:41:14,316 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488404628] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 15:41:14,316 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 15:41:14,316 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-16 15:41:14,316 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820031840] [2021-06-16 15:41:14,316 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-16 15:41:14,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 15:41:14,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-16 15:41:14,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-16 15:41:14,317 INFO L87 Difference]: Start difference. First operand 642 states and 1147 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 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-16 15:41:14,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-16 15:41:14,611 INFO L93 Difference]: Finished difference Result 703 states and 1294 transitions. [2021-06-16 15:41:14,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-16 15:41:14,613 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 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-16 15:41:14,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-16 15:41:14,617 INFO L225 Difference]: With dead ends: 703 [2021-06-16 15:41:14,618 INFO L226 Difference]: Without dead ends: 583 [2021-06-16 15:41:14,618 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 214.7ms TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2021-06-16 15:41:14,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2021-06-16 15:41:14,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 581. [2021-06-16 15:41:14,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 573 states have (on average 1.7993019197207678) internal successors, (1031), 580 states have internal predecessors, (1031), 0 states have call successors, (0), 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-16 15:41:14,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 1031 transitions. [2021-06-16 15:41:14,631 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 1031 transitions. Word has length 60 [2021-06-16 15:41:14,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-16 15:41:14,632 INFO L482 AbstractCegarLoop]: Abstraction has 581 states and 1031 transitions. [2021-06-16 15:41:14,632 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 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-16 15:41:14,632 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 1031 transitions. [2021-06-16 15:41:14,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-06-16 15:41:14,633 INFO L464 BasicCegarLoop]: Found error trace [2021-06-16 15:41:14,633 INFO L472 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] [2021-06-16 15:41:14,633 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-16 15:41:14,634 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 15:41:14,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 15:41:14,634 INFO L82 PathProgramCache]: Analyzing trace with hash 198287289, now seen corresponding path program 1 times [2021-06-16 15:41:14,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 15:41:14,634 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450207517] [2021-06-16 15:41:14,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 15:41:14,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 15:41:14,687 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:41:14,688 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:41:14,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:41:14,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-16 15:41:14,692 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-06-16 15:41:14,693 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-16 15:41:14,706 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:41:14,706 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-16 15:41:14,713 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-06-16 15:41:14,714 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:41:14,721 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:41:14,722 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:41:14,722 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-16 15:41:14,723 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 15:41:14,723 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450207517] [2021-06-16 15:41:14,723 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450207517] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 15:41:14,723 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 15:41:14,723 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-16 15:41:14,723 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285162710] [2021-06-16 15:41:14,724 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-16 15:41:14,724 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 15:41:14,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-16 15:41:14,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-16 15:41:14,724 INFO L87 Difference]: Start difference. First operand 581 states and 1031 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 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-16 15:41:14,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-16 15:41:14,822 INFO L93 Difference]: Finished difference Result 562 states and 918 transitions. [2021-06-16 15:41:14,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-16 15:41:14,822 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2021-06-16 15:41:14,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-16 15:41:14,824 INFO L225 Difference]: With dead ends: 562 [2021-06-16 15:41:14,824 INFO L226 Difference]: Without dead ends: 370 [2021-06-16 15:41:14,826 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 84.2ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-16 15:41:14,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2021-06-16 15:41:14,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2021-06-16 15:41:14,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 362 states have (on average 1.6906077348066297) internal successors, (612), 369 states have internal predecessors, (612), 0 states have call successors, (0), 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-16 15:41:14,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 612 transitions. [2021-06-16 15:41:14,834 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 612 transitions. Word has length 61 [2021-06-16 15:41:14,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-16 15:41:14,834 INFO L482 AbstractCegarLoop]: Abstraction has 370 states and 612 transitions. [2021-06-16 15:41:14,834 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 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-16 15:41:14,834 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 612 transitions. [2021-06-16 15:41:14,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-06-16 15:41:14,835 INFO L464 BasicCegarLoop]: Found error trace [2021-06-16 15:41:14,835 INFO L472 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] [2021-06-16 15:41:14,835 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-16 15:41:14,836 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 15:41:14,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 15:41:14,836 INFO L82 PathProgramCache]: Analyzing trace with hash 398923327, now seen corresponding path program 1 times [2021-06-16 15:41:14,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 15:41:14,836 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030411744] [2021-06-16 15:41:14,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 15:41:14,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 15:41:14,920 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:41:14,921 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:41:14,921 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:41:14,922 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-16 15:41:14,924 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:41:14,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-16 15:41:14,929 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-06-16 15:41:14,931 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-16 15:41:14,946 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:41:14,946 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-16 15:41:14,954 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-06-16 15:41:14,954 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:41:14,963 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:41:14,969 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:41:14,970 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-16 15:41:14,970 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 15:41:14,970 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030411744] [2021-06-16 15:41:14,970 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030411744] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 15:41:14,971 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 15:41:14,971 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-16 15:41:14,971 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330323317] [2021-06-16 15:41:14,971 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-16 15:41:14,971 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 15:41:14,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-16 15:41:14,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-16 15:41:14,972 INFO L87 Difference]: Start difference. First operand 370 states and 612 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 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-16 15:41:15,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-16 15:41:15,075 INFO L93 Difference]: Finished difference Result 248 states and 351 transitions. [2021-06-16 15:41:15,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-16 15:41:15,075 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2021-06-16 15:41:15,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-16 15:41:15,077 INFO L225 Difference]: With dead ends: 248 [2021-06-16 15:41:15,077 INFO L226 Difference]: Without dead ends: 143 [2021-06-16 15:41:15,078 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 94.1ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-06-16 15:41:15,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-06-16 15:41:15,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2021-06-16 15:41:15,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 140 states have (on average 1.292857142857143) internal successors, (181), 142 states have internal predecessors, (181), 0 states have call successors, (0), 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-16 15:41:15,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 181 transitions. [2021-06-16 15:41:15,089 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 181 transitions. Word has length 62 [2021-06-16 15:41:15,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-16 15:41:15,090 INFO L482 AbstractCegarLoop]: Abstraction has 143 states and 181 transitions. [2021-06-16 15:41:15,090 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 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-16 15:41:15,090 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 181 transitions. [2021-06-16 15:41:15,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-06-16 15:41:15,094 INFO L464 BasicCegarLoop]: Found error trace [2021-06-16 15:41:15,094 INFO L472 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] [2021-06-16 15:41:15,095 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-16 15:41:15,095 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 15:41:15,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 15:41:15,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1641592959, now seen corresponding path program 1 times [2021-06-16 15:41:15,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 15:41:15,095 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276155971] [2021-06-16 15:41:15,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 15:41:15,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-16 15:41:15,126 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-16 15:41:15,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-16 15:41:15,160 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-16 15:41:15,189 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-16 15:41:15,189 INFO L573 BasicCegarLoop]: Counterexample might be feasible [2021-06-16 15:41:15,189 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-16 15:41:15,190 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (3/3) [2021-06-16 15:41:15,191 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-16 15:41:15,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.06 03:41:15 BasicIcfg [2021-06-16 15:41:15,293 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-16 15:41:15,293 INFO L168 Benchmark]: Toolchain (without parser) took 7634.21 ms. Allocated memory was 255.9 MB in the beginning and 447.7 MB in the end (delta: 191.9 MB). Free memory was 218.5 MB in the beginning and 266.4 MB in the end (delta: -47.9 MB). Peak memory consumption was 144.2 MB. Max. memory is 8.0 GB. [2021-06-16 15:41:15,294 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 255.9 MB. Free memory is still 236.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-06-16 15:41:15,294 INFO L168 Benchmark]: CACSL2BoogieTranslator took 549.50 ms. Allocated memory is still 255.9 MB. Free memory was 218.4 MB in the beginning and 214.8 MB in the end (delta: 3.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2021-06-16 15:41:15,296 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.57 ms. Allocated memory is still 255.9 MB. Free memory was 214.8 MB in the beginning and 212.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-06-16 15:41:15,296 INFO L168 Benchmark]: Boogie Preprocessor took 29.68 ms. Allocated memory is still 255.9 MB. Free memory was 212.3 MB in the beginning and 210.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-06-16 15:41:15,298 INFO L168 Benchmark]: RCFGBuilder took 1791.60 ms. Allocated memory was 255.9 MB in the beginning and 331.4 MB in the end (delta: 75.5 MB). Free memory was 210.2 MB in the beginning and 232.7 MB in the end (delta: -22.5 MB). Peak memory consumption was 127.0 MB. Max. memory is 8.0 GB. [2021-06-16 15:41:15,298 INFO L168 Benchmark]: TraceAbstraction took 5190.55 ms. Allocated memory was 331.4 MB in the beginning and 447.7 MB in the end (delta: 116.4 MB). Free memory was 232.2 MB in the beginning and 266.4 MB in the end (delta: -34.2 MB). Peak memory consumption was 82.2 MB. Max. memory is 8.0 GB. [2021-06-16 15:41:15,302 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.17 ms. Allocated memory is still 255.9 MB. Free memory is still 236.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 549.50 ms. Allocated memory is still 255.9 MB. Free memory was 218.4 MB in the beginning and 214.8 MB in the end (delta: 3.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 62.57 ms. Allocated memory is still 255.9 MB. Free memory was 214.8 MB in the beginning and 212.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 29.68 ms. Allocated memory is still 255.9 MB. Free memory was 212.3 MB in the beginning and 210.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1791.60 ms. Allocated memory was 255.9 MB in the beginning and 331.4 MB in the end (delta: 75.5 MB). Free memory was 210.2 MB in the beginning and 232.7 MB in the end (delta: -22.5 MB). Peak memory consumption was 127.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 5190.55 ms. Allocated memory was 331.4 MB in the beginning and 447.7 MB in the end (delta: 116.4 MB). Free memory was 232.2 MB in the beginning and 266.4 MB in the end (delta: -34.2 MB). Peak memory consumption was 82.2 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4425, positive: 3890, positive conditional: 3890, positive unconditional: 0, negative: 535, negative conditional: 535, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4109, positive: 3890, positive conditional: 0, positive unconditional: 3890, negative: 219, negative conditional: 0, negative unconditional: 219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 583, positive: 560, positive conditional: 0, positive unconditional: 560, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 583, positive: 559, positive conditional: 0, positive unconditional: 559, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 24, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 306, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 305, negative conditional: 0, negative unconditional: 305, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4109, positive: 3330, positive conditional: 0, positive unconditional: 3330, negative: 196, negative conditional: 0, negative unconditional: 196, unknown: 583, unknown conditional: 0, unknown unconditional: 583] , Statistics on independence cache: Total cache size (in pairs): 583, Positive cache size: 560, Positive conditional cache size: 0, Positive unconditional cache size: 560, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, Independence queries for same thread: 316 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4425, positive: 3890, positive conditional: 3890, positive unconditional: 0, negative: 535, negative conditional: 535, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4109, positive: 3890, positive conditional: 0, positive unconditional: 3890, negative: 219, negative conditional: 0, negative unconditional: 219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 583, positive: 560, positive conditional: 0, positive unconditional: 560, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 583, positive: 559, positive conditional: 0, positive unconditional: 559, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 24, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 327, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 325, negative conditional: 0, negative unconditional: 325, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4109, positive: 3330, positive conditional: 0, positive unconditional: 3330, negative: 196, negative conditional: 0, negative unconditional: 196, unknown: 583, unknown conditional: 0, unknown unconditional: 583] , Statistics on independence cache: Total cache size (in pairs): 583, Positive cache size: 560, Positive conditional cache size: 0, Positive unconditional cache size: 560, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, Independence queries for same thread: 316 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4425, positive: 3890, positive conditional: 3890, positive unconditional: 0, negative: 535, negative conditional: 535, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4109, positive: 3890, positive conditional: 0, positive unconditional: 3890, negative: 219, negative conditional: 0, negative unconditional: 219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 583, positive: 560, positive conditional: 0, positive unconditional: 560, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 583, positive: 559, positive conditional: 0, positive unconditional: 559, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 24, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 261, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 260, negative conditional: 0, negative unconditional: 260, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4109, positive: 3330, positive conditional: 0, positive unconditional: 3330, negative: 196, negative conditional: 0, negative unconditional: 196, unknown: 583, unknown conditional: 0, unknown unconditional: 583] , Statistics on independence cache: Total cache size (in pairs): 583, Positive cache size: 560, Positive conditional cache size: 0, Positive unconditional cache size: 560, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, Independence queries for same thread: 316 - 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: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L711] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L712] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L714] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L715] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L716] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L717] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L718] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L719] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L720] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L721] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L722] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L723] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L724] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L725] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L726] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L727] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L728] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L730] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L731] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L732] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L792] 0 pthread_t t1447; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L793] FCALL, FORK 0 pthread_create(&t1447, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L794] 0 pthread_t t1448; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L795] FCALL, FORK 0 pthread_create(&t1448, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] 2 x$w_buff1 = x$w_buff0 [L757] 2 x$w_buff0 = 2 [L758] 2 x$w_buff1_used = x$w_buff0_used [L759] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L761] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L767] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L736] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L742] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L742] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L743] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L743] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L744] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L745] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L745] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L746] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L770] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L771] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L772] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L772] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L773] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L773] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L774] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L774] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L801] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L801] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L802] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L802] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L803] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L803] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L804] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L804] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L805] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L805] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 x$flush_delayed = weak$$choice2 [L811] 0 x$mem_tmp = x [L812] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L812] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L813] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L813] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L813] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L813] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L814] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L814] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L814] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L814] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L815] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L815] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L815] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L815] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L816] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L816] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L817] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L817] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L817] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L818] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L818] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L818] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L818] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) [L820] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L820] 0 x = x$flush_delayed ? x$mem_tmp : x [L821] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L18] 0 reach_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P1 with 1 thread instances CFG has 5 procedures, 104 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 543.5ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 26.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 513.0ms, PartialOrderReductionTime: 496.1ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1892occurred 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: P1Thread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 104 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 785.7ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 5.5ms, AutomataDifference: 86.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 417.9ms, PartialOrderReductionTime: 416.4ms, HoareTripleCheckerStatistics: 76 SDtfs, 27 SDslu, 51 SDs, 0 SdLazy, 9 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1892occurred 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: 8.8ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 7.0ms SsaConstructionTime, 38.4ms SatisfiabilityAnalysisTime, 118.0ms InterpolantComputationTime, 45 NumberOfCodeBlocks, 45 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 44 ConstructedInterpolants, 0 QuantifiedInterpolants, 86 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 5 procedures, 104 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 3640.2ms, OverallIterations: 9, TraceHistogramMax: 1, EmptinessCheckTime: 22.2ms, AutomataDifference: 1535.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 349.8ms, PartialOrderReductionTime: 348.3ms, HoareTripleCheckerStatistics: 708 SDtfs, 959 SDslu, 2361 SDs, 0 SdLazy, 517 SolverSat, 98 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 544.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 106 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1076.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1892occurred in iteration=0, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 156.1ms AutomataMinimizationTime, 8 MinimizatonAttempts, 19 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 27.1ms SsaConstructionTime, 315.7ms SatisfiabilityAnalysisTime, 1050.0ms InterpolantComputationTime, 544 NumberOfCodeBlocks, 544 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 469 ConstructedInterpolants, 0 QuantifiedInterpolants, 2224 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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...