/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/mix033_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-98196c323137eee61a7c1131837b356358d783d4-98196c3 [2021-06-16 15:29:10,237 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-16 15:29:10,239 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-16 15:29:10,275 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-16 15:29:10,276 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-16 15:29:10,279 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-16 15:29:10,281 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-16 15:29:10,287 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-16 15:29:10,289 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-16 15:29:10,294 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-16 15:29:10,295 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-16 15:29:10,296 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-16 15:29:10,296 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-16 15:29:10,298 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-16 15:29:10,299 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-16 15:29:10,300 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-16 15:29:10,304 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-16 15:29:10,304 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-16 15:29:10,306 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-16 15:29:10,312 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-16 15:29:10,313 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-16 15:29:10,314 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-16 15:29:10,315 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-16 15:29:10,317 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-16 15:29:10,320 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-16 15:29:10,321 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-16 15:29:10,321 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-16 15:29:10,322 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-16 15:29:10,322 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-16 15:29:10,323 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-16 15:29:10,323 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-16 15:29:10,324 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-16 15:29:10,325 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-16 15:29:10,325 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-16 15:29:10,326 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-16 15:29:10,326 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-16 15:29:10,327 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-16 15:29:10,327 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-16 15:29:10,327 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-16 15:29:10,327 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-16 15:29:10,328 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-16 15:29:10,332 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:29:10,363 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-16 15:29:10,363 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-16 15:29:10,365 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-16 15:29:10,366 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-16 15:29:10,366 INFO L138 SettingsManager]: * Use SBE=true [2021-06-16 15:29:10,366 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-16 15:29:10,366 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-16 15:29:10,366 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-16 15:29:10,366 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-16 15:29:10,366 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-16 15:29:10,367 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-16 15:29:10,367 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-16 15:29:10,367 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-16 15:29:10,367 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-16 15:29:10,368 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-16 15:29:10,368 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-16 15:29:10,368 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-16 15:29:10,368 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-16 15:29:10,368 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-16 15:29:10,368 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-16 15:29:10,368 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-16 15:29:10,368 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-16 15:29:10,368 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-16 15:29:10,368 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-16 15:29:10,369 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-16 15:29:10,369 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-16 15:29:10,369 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-16 15:29:10,369 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-16 15:29:10,369 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-16 15:29:10,369 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_DELAY_SET [2021-06-16 15:29:10,369 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:29:10,667 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-16 15:29:10,687 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-16 15:29:10,689 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-16 15:29:10,690 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-16 15:29:10,690 INFO L275 PluginConnector]: CDTParser initialized [2021-06-16 15:29:10,691 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i [2021-06-16 15:29:10,750 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42c2ac8a8/0a4be01eb71c4a99ba31ed4d3c743ec5/FLAGbf49635a2 [2021-06-16 15:29:11,256 INFO L306 CDTParser]: Found 1 translation units. [2021-06-16 15:29:11,257 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i [2021-06-16 15:29:11,277 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42c2ac8a8/0a4be01eb71c4a99ba31ed4d3c743ec5/FLAGbf49635a2 [2021-06-16 15:29:11,576 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42c2ac8a8/0a4be01eb71c4a99ba31ed4d3c743ec5 [2021-06-16 15:29:11,578 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-16 15:29:11,580 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-16 15:29:11,581 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-16 15:29:11,581 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-16 15:29:11,583 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-16 15:29:11,584 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.06 03:29:11" (1/1) ... [2021-06-16 15:29:11,585 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a4e4215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:29:11, skipping insertion in model container [2021-06-16 15:29:11,585 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.06 03:29:11" (1/1) ... [2021-06-16 15:29:11,590 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-16 15:29:11,631 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-16 15:29:11,763 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/mix033_tso.oepc.i[949,962] [2021-06-16 15:29:11,936 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-16 15:29:11,941 INFO L203 MainTranslator]: Completed pre-run [2021-06-16 15:29:11,954 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/mix033_tso.oepc.i[949,962] [2021-06-16 15:29:12,002 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-16 15:29:12,041 INFO L208 MainTranslator]: Completed translation [2021-06-16 15:29:12,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:29:12 WrapperNode [2021-06-16 15:29:12,041 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-16 15:29:12,042 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-16 15:29:12,042 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-16 15:29:12,042 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-16 15:29:12,046 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:29:12" (1/1) ... [2021-06-16 15:29:12,070 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:29:12" (1/1) ... [2021-06-16 15:29:12,092 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-16 15:29:12,093 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-16 15:29:12,093 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-16 15:29:12,093 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-16 15:29:12,100 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:29:12" (1/1) ... [2021-06-16 15:29:12,100 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:29:12" (1/1) ... [2021-06-16 15:29:12,109 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:29:12" (1/1) ... [2021-06-16 15:29:12,109 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:29:12" (1/1) ... [2021-06-16 15:29:12,119 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:29:12" (1/1) ... [2021-06-16 15:29:12,123 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:29:12" (1/1) ... [2021-06-16 15:29:12,131 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:29:12" (1/1) ... [2021-06-16 15:29:12,135 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-16 15:29:12,136 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-16 15:29:12,136 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-16 15:29:12,137 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-16 15:29:12,138 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:29:12" (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:29:12,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-16 15:29:12,189 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-16 15:29:12,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-16 15:29:12,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-16 15:29:12,190 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-16 15:29:12,190 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-16 15:29:12,191 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-16 15:29:12,191 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-16 15:29:12,191 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-16 15:29:12,191 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-16 15:29:12,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-16 15:29:12,191 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-16 15:29:12,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-16 15:29:12,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-16 15:29:12,193 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:29:13,549 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-16 15:29:13,549 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-16 15:29:13,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.06 03:29:13 BoogieIcfgContainer [2021-06-16 15:29:13,551 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-16 15:29:13,552 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-16 15:29:13,552 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-16 15:29:13,554 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-16 15:29:13,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.06 03:29:11" (1/3) ... [2021-06-16 15:29:13,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b631933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.06 03:29:13, skipping insertion in model container [2021-06-16 15:29:13,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:29:12" (2/3) ... [2021-06-16 15:29:13,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b631933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.06 03:29:13, skipping insertion in model container [2021-06-16 15:29:13,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.06 03:29:13" (3/3) ... [2021-06-16 15:29:13,555 INFO L111 eAbstractionObserver]: Analyzing ICFG mix033_tso.oepc.i [2021-06-16 15:29:13,567 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-16 15:29:13,567 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-16 15:29:13,567 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-16 15:29:13,568 INFO L470 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-16 15:29:13,588 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,588 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,588 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,588 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,588 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,588 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,588 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,589 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,590 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,590 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,590 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,590 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,590 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,590 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,590 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,590 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,590 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,591 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,591 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,591 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,591 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,591 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,591 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,591 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,591 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,591 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,591 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,592 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,592 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,592 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,592 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,592 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,592 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,592 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,592 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,592 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,593 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,593 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,593 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,593 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,593 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,593 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,593 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,593 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,593 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,593 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,593 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,594 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,594 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,594 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,594 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,594 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,594 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,594 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,594 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,594 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,595 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,595 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,595 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,595 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,595 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,595 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,595 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,595 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,595 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,595 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,596 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,596 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,596 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,596 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,596 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,596 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,596 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,596 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,597 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,597 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,597 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,598 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,598 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,598 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,600 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,600 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,601 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,602 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,603 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,603 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,603 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,603 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:29:13,604 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-16 15:29:13,617 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-16 15:29:13,628 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-16 15:29:13,628 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-16 15:29:13,628 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-16 15:29:13,628 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-16 15:29:13,629 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-16 15:29:13,629 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-16 15:29:13,629 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-16 15:29:13,629 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P1======== [2021-06-16 15:29:15,619 INFO L276 IsEmpty]: Start isEmpty. Operand has 24476 states, 22022 states have (on average 2.1939878303514666) internal successors, (48316), 24475 states have internal predecessors, (48316), 0 states have call successors, (0), 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:29:15,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-16 15:29:15,690 INFO L301 ceAbstractionStarter]: Result for error location P1 was SAFE (1/3) [2021-06-16 15:29:15,691 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-16 15:29:15,693 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-16 15:29:15,693 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-16 15:29:15,693 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-16 15:29:15,693 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-16 15:29:15,693 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-16 15:29:15,693 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-16 15:29:15,693 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-16 15:29:15,693 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P1Thread1of1ForFork0======== [2021-06-16 15:29:17,601 INFO L276 IsEmpty]: Start isEmpty. Operand has 24476 states, 22022 states have (on average 2.1939878303514666) internal successors, (48316), 24475 states have internal predecessors, (48316), 0 states have call successors, (0), 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:29:17,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-06-16 15:29:17,732 INFO L464 BasicCegarLoop]: Found error trace [2021-06-16 15:29:17,733 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] [2021-06-16 15:29:17,733 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 15:29:17,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 15:29:17,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1307067091, now seen corresponding path program 1 times [2021-06-16 15:29:17,742 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 15:29:17,742 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651354460] [2021-06-16 15:29:17,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 15:29:17,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 15:29:17,932 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:29:17,933 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:29:17,933 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:29:17,934 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-16 15:29:17,944 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:29:17,945 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 15:29:17,945 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651354460] [2021-06-16 15:29:17,945 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651354460] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 15:29:17,946 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 15:29:17,946 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-16 15:29:17,946 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730250561] [2021-06-16 15:29:17,948 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-16 15:29:17,949 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 15:29:17,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-16 15:29:17,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-16 15:29:17,995 INFO L87 Difference]: Start difference. First operand has 24476 states, 22022 states have (on average 2.1939878303514666) internal successors, (48316), 24475 states have internal predecessors, (48316), 0 states have call successors, (0), 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 26.5) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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:29:18,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-16 15:29:18,191 INFO L93 Difference]: Finished difference Result 21460 states and 41571 transitions. [2021-06-16 15:29:18,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 15:29:18,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2021-06-16 15:29:18,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-16 15:29:18,199 INFO L225 Difference]: With dead ends: 21460 [2021-06-16 15:29:18,199 INFO L226 Difference]: Without dead ends: 0 [2021-06-16 15:29:18,200 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-16 15:29:18,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-16 15:29:18,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-16 15:29:18,215 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:29:18,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-16 15:29:18,216 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53 [2021-06-16 15:29:18,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-16 15:29:18,216 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-16 15:29:18,216 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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:29:18,216 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-16 15:29:18,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-16 15:29:18,216 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-16 15:29:18,217 INFO L301 ceAbstractionStarter]: Result for error location P1Thread1of1ForFork0 was SAFE (2/3) [2021-06-16 15:29:18,218 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-06-16 15:29:18,227 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-16 15:29:18,228 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-16 15:29:18,228 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-16 15:29:18,228 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-16 15:29:18,228 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-16 15:29:18,228 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-16 15:29:18,228 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-16 15:29:18,228 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-16 15:29:20,351 INFO L276 IsEmpty]: Start isEmpty. Operand has 24476 states, 22022 states have (on average 2.1939878303514666) internal successors, (48316), 24475 states have internal predecessors, (48316), 0 states have call successors, (0), 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:29:20,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-16 15:29:20,362 INFO L464 BasicCegarLoop]: Found error trace [2021-06-16 15:29:20,362 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, 1, 1, 1, 1, 1] [2021-06-16 15:29:20,362 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 15:29:20,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 15:29:20,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1095003396, now seen corresponding path program 1 times [2021-06-16 15:29:20,363 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 15:29:20,363 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356545885] [2021-06-16 15:29:20,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 15:29:20,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 15:29:20,538 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:29:20,539 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:29:20,539 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:29:20,540 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-16 15:29:20,547 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-16 15:29:20,548 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-16 15:29:20,562 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:29:20,563 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:29:20,570 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:29:20,571 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:29:20,578 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:29:20,578 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:29:20,579 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:29:20,579 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 15:29:20,579 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356545885] [2021-06-16 15:29:20,580 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356545885] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 15:29:20,580 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 15:29:20,580 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-16 15:29:20,580 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171357361] [2021-06-16 15:29:20,580 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-16 15:29:20,581 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 15:29:20,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-16 15:29:20,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-16 15:29:20,624 INFO L87 Difference]: Start difference. First operand has 24476 states, 22022 states have (on average 2.1939878303514666) internal successors, (48316), 24475 states have internal predecessors, (48316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 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:29:21,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-16 15:29:21,005 INFO L93 Difference]: Finished difference Result 30284 states and 62387 transitions. [2021-06-16 15:29:21,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-16 15:29:21,006 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2021-06-16 15:29:21,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-16 15:29:21,039 INFO L225 Difference]: With dead ends: 30284 [2021-06-16 15:29:21,040 INFO L226 Difference]: Without dead ends: 7586 [2021-06-16 15:29:21,040 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 72.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-16 15:29:21,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7586 states. [2021-06-16 15:29:21,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7586 to 7586. [2021-06-16 15:29:21,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7586 states, 7498 states have (on average 2.130434782608696) internal successors, (15974), 7585 states have internal predecessors, (15974), 0 states have call successors, (0), 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:29:21,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7586 states to 7586 states and 15974 transitions. [2021-06-16 15:29:21,255 INFO L78 Accepts]: Start accepts. Automaton has 7586 states and 15974 transitions. Word has length 72 [2021-06-16 15:29:21,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-16 15:29:21,256 INFO L482 AbstractCegarLoop]: Abstraction has 7586 states and 15974 transitions. [2021-06-16 15:29:21,256 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 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:29:21,256 INFO L276 IsEmpty]: Start isEmpty. Operand 7586 states and 15974 transitions. [2021-06-16 15:29:21,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-06-16 15:29:21,266 INFO L464 BasicCegarLoop]: Found error trace [2021-06-16 15:29:21,266 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-16 15:29:21,267 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-16 15:29:21,267 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 15:29:21,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 15:29:21,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1529368518, now seen corresponding path program 1 times [2021-06-16 15:29:21,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 15:29:21,268 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290649962] [2021-06-16 15:29:21,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 15:29:21,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 15:29:21,415 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:29:21,416 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:29:21,423 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:29:21,424 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-16 15:29:21,428 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-16 15:29:21,429 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-16 15:29:21,452 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:29:21,452 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:29:21,461 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:29:21,461 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:29:21,470 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:29:21,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:29:21,471 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:29:21,471 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 15:29:21,471 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290649962] [2021-06-16 15:29:21,471 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290649962] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 15:29:21,471 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 15:29:21,471 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-16 15:29:21,472 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885405403] [2021-06-16 15:29:21,473 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-16 15:29:21,473 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 15:29:21,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-16 15:29:21,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-16 15:29:21,474 INFO L87 Difference]: Start difference. First operand 7586 states and 15974 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 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:29:21,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-16 15:29:21,619 INFO L93 Difference]: Finished difference Result 7954 states and 17164 transitions. [2021-06-16 15:29:21,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-16 15:29:21,620 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2021-06-16 15:29:21,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-16 15:29:21,640 INFO L225 Difference]: With dead ends: 7954 [2021-06-16 15:29:21,641 INFO L226 Difference]: Without dead ends: 5610 [2021-06-16 15:29:21,642 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 92.1ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-16 15:29:21,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5610 states. [2021-06-16 15:29:21,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5610 to 5610. [2021-06-16 15:29:21,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5610 states, 5562 states have (on average 2.04980222941388) internal successors, (11401), 5609 states have internal predecessors, (11401), 0 states have call successors, (0), 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:29:21,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5610 states to 5610 states and 11401 transitions. [2021-06-16 15:29:21,921 INFO L78 Accepts]: Start accepts. Automaton has 5610 states and 11401 transitions. Word has length 76 [2021-06-16 15:29:21,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-16 15:29:21,922 INFO L482 AbstractCegarLoop]: Abstraction has 5610 states and 11401 transitions. [2021-06-16 15:29:21,922 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 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:29:21,922 INFO L276 IsEmpty]: Start isEmpty. Operand 5610 states and 11401 transitions. [2021-06-16 15:29:21,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-16 15:29:21,929 INFO L464 BasicCegarLoop]: Found error trace [2021-06-16 15:29:21,929 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-16 15:29:21,929 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-16 15:29:21,930 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 15:29:21,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 15:29:21,930 INFO L82 PathProgramCache]: Analyzing trace with hash -2144036327, now seen corresponding path program 1 times [2021-06-16 15:29:21,930 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 15:29:21,930 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600071414] [2021-06-16 15:29:21,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 15:29:21,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 15:29:22,020 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:29:22,021 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:29:22,021 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:29:22,021 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-16 15:29:22,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:29:22,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-16 15:29:22,030 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:29:22,031 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-16 15:29:22,037 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:29:22,038 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-16 15:29:22,049 INFO L142 QuantifierPusher]: treesize reduction 26, result has 56.7 percent of original size [2021-06-16 15:29:22,050 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-06-16 15:29:22,070 INFO L142 QuantifierPusher]: treesize reduction 26, result has 56.7 percent of original size [2021-06-16 15:29:22,071 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-06-16 15:29:22,097 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-16 15:29:22,098 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-16 15:29:22,119 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:29:22,119 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:29:22,128 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:29:22,129 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:29:22,141 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:29:22,142 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:29:22,142 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:29:22,143 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 15:29:22,143 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600071414] [2021-06-16 15:29:22,143 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600071414] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 15:29:22,143 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 15:29:22,143 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-16 15:29:22,143 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328749962] [2021-06-16 15:29:22,144 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-16 15:29:22,144 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 15:29:22,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-16 15:29:22,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-06-16 15:29:22,145 INFO L87 Difference]: Start difference. First operand 5610 states and 11401 transitions. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 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:29:22,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-16 15:29:22,554 INFO L93 Difference]: Finished difference Result 6522 states and 13889 transitions. [2021-06-16 15:29:22,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-16 15:29:22,555 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2021-06-16 15:29:22,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-16 15:29:22,578 INFO L225 Difference]: With dead ends: 6522 [2021-06-16 15:29:22,578 INFO L226 Difference]: Without dead ends: 5706 [2021-06-16 15:29:22,578 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 277.6ms TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2021-06-16 15:29:22,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5706 states. [2021-06-16 15:29:22,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5706 to 5706. [2021-06-16 15:29:22,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5706 states, 5658 states have (on average 2.0227995758218453) internal successors, (11445), 5705 states have internal predecessors, (11445), 0 states have call successors, (0), 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:29:22,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5706 states to 5706 states and 11445 transitions. [2021-06-16 15:29:22,801 INFO L78 Accepts]: Start accepts. Automaton has 5706 states and 11445 transitions. Word has length 80 [2021-06-16 15:29:22,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-16 15:29:22,803 INFO L482 AbstractCegarLoop]: Abstraction has 5706 states and 11445 transitions. [2021-06-16 15:29:22,803 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 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:29:22,803 INFO L276 IsEmpty]: Start isEmpty. Operand 5706 states and 11445 transitions. [2021-06-16 15:29:22,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-06-16 15:29:22,813 INFO L464 BasicCegarLoop]: Found error trace [2021-06-16 15:29:22,813 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-16 15:29:22,814 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-16 15:29:22,814 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 15:29:22,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 15:29:22,814 INFO L82 PathProgramCache]: Analyzing trace with hash 460010394, now seen corresponding path program 1 times [2021-06-16 15:29:22,814 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 15:29:22,818 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013239332] [2021-06-16 15:29:22,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 15:29:22,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 15:29:22,909 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:29:22,909 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:29:22,910 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:29:22,910 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-16 15:29:22,915 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-06-16 15:29:22,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-16 15:29:22,930 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:29:22,931 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-16 15:29:22,939 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-06-16 15:29:22,944 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:29:22,952 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:29:22,953 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:29:22,955 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:29:22,955 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 15:29:22,955 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013239332] [2021-06-16 15:29:22,955 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013239332] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 15:29:22,955 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 15:29:22,955 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-16 15:29:22,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656416365] [2021-06-16 15:29:22,956 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-16 15:29:22,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 15:29:22,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-16 15:29:22,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-16 15:29:22,957 INFO L87 Difference]: Start difference. First operand 5706 states and 11445 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:29:23,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-16 15:29:23,110 INFO L93 Difference]: Finished difference Result 6576 states and 12481 transitions. [2021-06-16 15:29:23,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-16 15:29:23,111 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-06-16 15:29:23,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-16 15:29:23,126 INFO L225 Difference]: With dead ends: 6576 [2021-06-16 15:29:23,126 INFO L226 Difference]: Without dead ends: 4176 [2021-06-16 15:29:23,126 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 86.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-16 15:29:23,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4176 states. [2021-06-16 15:29:23,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4176 to 4176. [2021-06-16 15:29:23,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4176 states, 4128 states have (on average 2.02156007751938) internal successors, (8345), 4175 states have internal predecessors, (8345), 0 states have call successors, (0), 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:29:23,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4176 states to 4176 states and 8345 transitions. [2021-06-16 15:29:23,225 INFO L78 Accepts]: Start accepts. Automaton has 4176 states and 8345 transitions. Word has length 82 [2021-06-16 15:29:23,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-16 15:29:23,226 INFO L482 AbstractCegarLoop]: Abstraction has 4176 states and 8345 transitions. [2021-06-16 15:29:23,226 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:29:23,226 INFO L276 IsEmpty]: Start isEmpty. Operand 4176 states and 8345 transitions. [2021-06-16 15:29:23,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-06-16 15:29:23,235 INFO L464 BasicCegarLoop]: Found error trace [2021-06-16 15:29:23,236 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-16 15:29:23,236 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-16 15:29:23,236 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 15:29:23,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 15:29:23,236 INFO L82 PathProgramCache]: Analyzing trace with hash 141775302, now seen corresponding path program 1 times [2021-06-16 15:29:23,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 15:29:23,236 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673439909] [2021-06-16 15:29:23,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 15:29:23,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 15:29:23,331 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:29:23,332 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:29:23,332 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:29:23,332 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-16 15:29:23,335 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:29:23,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-16 15:29:23,339 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-06-16 15:29:23,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-16 15:29:23,353 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:29:23,353 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-16 15:29:23,360 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-06-16 15:29:23,361 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:29:23,367 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:29:23,368 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:29:23,369 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:29:23,370 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 15:29:23,370 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673439909] [2021-06-16 15:29:23,370 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673439909] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 15:29:23,370 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 15:29:23,370 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-16 15:29:23,370 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480058033] [2021-06-16 15:29:23,370 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-16 15:29:23,370 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 15:29:23,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-16 15:29:23,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-16 15:29:23,371 INFO L87 Difference]: Start difference. First operand 4176 states and 8345 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 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:29:23,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-16 15:29:23,476 INFO L93 Difference]: Finished difference Result 3498 states and 6285 transitions. [2021-06-16 15:29:23,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-16 15:29:23,477 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2021-06-16 15:29:23,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-16 15:29:23,485 INFO L225 Difference]: With dead ends: 3498 [2021-06-16 15:29:23,485 INFO L226 Difference]: Without dead ends: 1944 [2021-06-16 15:29:23,485 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 80.0ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-06-16 15:29:23,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1944 states. [2021-06-16 15:29:23,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1944 to 1932. [2021-06-16 15:29:23,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1932 states, 1899 states have (on average 1.8425487098472881) internal successors, (3499), 1931 states have internal predecessors, (3499), 0 states have call successors, (0), 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:29:23,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1932 states to 1932 states and 3499 transitions. [2021-06-16 15:29:23,547 INFO L78 Accepts]: Start accepts. Automaton has 1932 states and 3499 transitions. Word has length 83 [2021-06-16 15:29:23,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-16 15:29:23,547 INFO L482 AbstractCegarLoop]: Abstraction has 1932 states and 3499 transitions. [2021-06-16 15:29:23,547 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 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:29:23,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1932 states and 3499 transitions. [2021-06-16 15:29:23,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-16 15:29:23,550 INFO L464 BasicCegarLoop]: Found error trace [2021-06-16 15:29:23,550 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-16 15:29:23,550 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-16 15:29:23,550 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 15:29:23,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 15:29:23,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1553674210, now seen corresponding path program 1 times [2021-06-16 15:29:23,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 15:29:23,551 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442198989] [2021-06-16 15:29:23,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 15:29:23,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 15:29:23,647 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:29:23,648 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:29:23,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:29:23,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-16 15:29:23,654 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:29:23,654 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-16 15:29:23,658 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-16 15:29:23,660 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-16 15:29:23,678 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:29:23,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:29:23,687 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:29:23,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:29:23,697 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:29:23,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:29:23,698 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:29:23,698 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 15:29:23,698 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442198989] [2021-06-16 15:29:23,699 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442198989] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 15:29:23,699 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 15:29:23,699 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-16 15:29:23,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378880720] [2021-06-16 15:29:23,699 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-16 15:29:23,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 15:29:23,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-16 15:29:23,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-16 15:29:23,700 INFO L87 Difference]: Start difference. First operand 1932 states and 3499 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:29:23,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-16 15:29:23,784 INFO L93 Difference]: Finished difference Result 2960 states and 5639 transitions. [2021-06-16 15:29:23,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-16 15:29:23,785 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2021-06-16 15:29:23,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-16 15:29:23,788 INFO L225 Difference]: With dead ends: 2960 [2021-06-16 15:29:23,788 INFO L226 Difference]: Without dead ends: 2012 [2021-06-16 15:29:23,788 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 78.7ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-16 15:29:23,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2012 states. [2021-06-16 15:29:23,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2012 to 1892. [2021-06-16 15:29:23,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1892 states, 1859 states have (on average 1.8450779989241528) internal successors, (3430), 1891 states have internal predecessors, (3430), 0 states have call successors, (0), 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:29:23,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1892 states to 1892 states and 3430 transitions. [2021-06-16 15:29:23,818 INFO L78 Accepts]: Start accepts. Automaton has 1892 states and 3430 transitions. Word has length 86 [2021-06-16 15:29:23,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-16 15:29:23,818 INFO L482 AbstractCegarLoop]: Abstraction has 1892 states and 3430 transitions. [2021-06-16 15:29:23,818 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:29:23,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 3430 transitions. [2021-06-16 15:29:23,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-16 15:29:23,821 INFO L464 BasicCegarLoop]: Found error trace [2021-06-16 15:29:23,821 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-16 15:29:23,821 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-16 15:29:23,821 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 15:29:23,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 15:29:23,822 INFO L82 PathProgramCache]: Analyzing trace with hash -130246392, now seen corresponding path program 2 times [2021-06-16 15:29:23,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 15:29:23,822 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872001858] [2021-06-16 15:29:23,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 15:29:23,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 15:29:23,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:29:23,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:29:23,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:29:23,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-16 15:29:23,873 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:29:23,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-16 15:29:23,876 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:29:23,877 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-16 15:29:23,881 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-06-16 15:29:23,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-16 15:29:23,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:29:23,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-16 15:29:23,902 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-06-16 15:29:23,902 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:29:23,909 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:29:23,910 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:29:23,910 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:29:23,910 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 15:29:23,910 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872001858] [2021-06-16 15:29:23,910 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872001858] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 15:29:23,910 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 15:29:23,910 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-16 15:29:23,910 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581475592] [2021-06-16 15:29:23,911 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-16 15:29:23,911 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 15:29:23,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-16 15:29:23,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-16 15:29:23,911 INFO L87 Difference]: Start difference. First operand 1892 states and 3430 transitions. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:29:24,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-16 15:29:24,024 INFO L93 Difference]: Finished difference Result 1382 states and 2167 transitions. [2021-06-16 15:29:24,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-16 15:29:24,025 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2021-06-16 15:29:24,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-16 15:29:24,027 INFO L225 Difference]: With dead ends: 1382 [2021-06-16 15:29:24,027 INFO L226 Difference]: Without dead ends: 615 [2021-06-16 15:29:24,027 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 92.4ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-06-16 15:29:24,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2021-06-16 15:29:24,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 615. [2021-06-16 15:29:24,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 606 states have (on average 1.4834983498349834) internal successors, (899), 614 states have internal predecessors, (899), 0 states have call successors, (0), 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:29:24,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 899 transitions. [2021-06-16 15:29:24,037 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 899 transitions. Word has length 86 [2021-06-16 15:29:24,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-16 15:29:24,037 INFO L482 AbstractCegarLoop]: Abstraction has 615 states and 899 transitions. [2021-06-16 15:29:24,037 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 15:29:24,037 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 899 transitions. [2021-06-16 15:29:24,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-06-16 15:29:24,038 INFO L464 BasicCegarLoop]: Found error trace [2021-06-16 15:29:24,038 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, 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:29:24,039 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-16 15:29:24,039 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 15:29:24,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 15:29:24,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1033848366, now seen corresponding path program 1 times [2021-06-16 15:29:24,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 15:29:24,039 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003232089] [2021-06-16 15:29:24,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 15:29:24,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 15:29:24,120 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:29:24,120 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:29:24,121 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:29:24,121 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-16 15:29:24,123 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:29:24,124 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-16 15:29:24,128 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:29:24,129 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-16 15:29:24,136 INFO L142 QuantifierPusher]: treesize reduction 4, result has 89.7 percent of original size [2021-06-16 15:29:24,137 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-06-16 15:29:24,159 INFO L142 QuantifierPusher]: treesize reduction 37, result has 50.7 percent of original size [2021-06-16 15:29:24,160 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-06-16 15:29:24,186 INFO L142 QuantifierPusher]: treesize reduction 37, result has 52.6 percent of original size [2021-06-16 15:29:24,189 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-06-16 15:29:24,218 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:29:24,219 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-06-16 15:29:24,237 INFO L142 QuantifierPusher]: treesize reduction 5, result has 80.0 percent of original size [2021-06-16 15:29:24,237 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-06-16 15:29:24,255 INFO L142 QuantifierPusher]: treesize reduction 19, result has 76.3 percent of original size [2021-06-16 15:29:24,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 61 [2021-06-16 15:29:24,284 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-16 15:29:24,285 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-16 15:29:24,304 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:29:24,305 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:29:24,317 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:29:24,318 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:29:24,327 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:29:24,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:29:24,328 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:29:24,328 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 15:29:24,328 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003232089] [2021-06-16 15:29:24,328 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003232089] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 15:29:24,329 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 15:29:24,329 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-06-16 15:29:24,329 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081601484] [2021-06-16 15:29:24,329 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-16 15:29:24,329 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 15:29:24,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-16 15:29:24,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2021-06-16 15:29:24,330 INFO L87 Difference]: Start difference. First operand 615 states and 899 transitions. Second operand has 14 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 0 states have call successors, (0), 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:29:24,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-16 15:29:24,696 INFO L93 Difference]: Finished difference Result 1261 states and 1972 transitions. [2021-06-16 15:29:24,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-16 15:29:24,696 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2021-06-16 15:29:24,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-16 15:29:24,698 INFO L225 Difference]: With dead ends: 1261 [2021-06-16 15:29:24,698 INFO L226 Difference]: Without dead ends: 886 [2021-06-16 15:29:24,698 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 366.3ms TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2021-06-16 15:29:24,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2021-06-16 15:29:24,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 539. [2021-06-16 15:29:24,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 530 states have (on average 1.5037735849056604) internal successors, (797), 538 states have internal predecessors, (797), 0 states have call successors, (0), 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:29:24,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 797 transitions. [2021-06-16 15:29:24,709 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 797 transitions. Word has length 91 [2021-06-16 15:29:24,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-16 15:29:24,710 INFO L482 AbstractCegarLoop]: Abstraction has 539 states and 797 transitions. [2021-06-16 15:29:24,710 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 0 states have call successors, (0), 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:29:24,710 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 797 transitions. [2021-06-16 15:29:24,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-06-16 15:29:24,711 INFO L464 BasicCegarLoop]: Found error trace [2021-06-16 15:29:24,711 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, 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:29:24,711 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-16 15:29:24,711 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 15:29:24,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 15:29:24,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1525524238, now seen corresponding path program 2 times [2021-06-16 15:29:24,712 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 15:29:24,712 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761357961] [2021-06-16 15:29:24,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 15:29:24,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-16 15:29:24,754 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-16 15:29:24,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-16 15:29:24,798 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-16 15:29:24,831 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-16 15:29:24,831 INFO L573 BasicCegarLoop]: Counterexample might be feasible [2021-06-16 15:29:24,831 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-16 15:29:24,832 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (3/3) [2021-06-16 15:29:24,833 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-16 15:29:24,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.06 03:29:24 BasicIcfg [2021-06-16 15:29:24,913 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-16 15:29:24,913 INFO L168 Benchmark]: Toolchain (without parser) took 13333.60 ms. Allocated memory was 172.0 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 133.4 MB in the beginning and 3.5 GB in the end (delta: -3.3 GB). Peak memory consumption was 387.3 MB. Max. memory is 8.0 GB. [2021-06-16 15:29:24,914 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 172.0 MB. Free memory is still 152.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-06-16 15:29:24,914 INFO L168 Benchmark]: CACSL2BoogieTranslator took 460.53 ms. Allocated memory is still 172.0 MB. Free memory was 133.2 MB in the beginning and 129.6 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:29:24,914 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.52 ms. Allocated memory is still 172.0 MB. Free memory was 129.6 MB in the beginning and 126.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-06-16 15:29:24,914 INFO L168 Benchmark]: Boogie Preprocessor took 41.91 ms. Allocated memory is still 172.0 MB. Free memory was 126.5 MB in the beginning and 124.4 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:29:24,914 INFO L168 Benchmark]: RCFGBuilder took 1414.56 ms. Allocated memory was 172.0 MB in the beginning and 219.2 MB in the end (delta: 47.2 MB). Free memory was 124.4 MB in the beginning and 183.4 MB in the end (delta: -59.0 MB). Peak memory consumption was 86.1 MB. Max. memory is 8.0 GB. [2021-06-16 15:29:24,914 INFO L168 Benchmark]: TraceAbstraction took 11360.88 ms. Allocated memory was 219.2 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 183.4 MB in the beginning and 3.5 GB in the end (delta: -3.3 GB). Peak memory consumption was 389.2 MB. Max. memory is 8.0 GB. [2021-06-16 15:29:24,915 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 172.0 MB. Free memory is still 152.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 460.53 ms. Allocated memory is still 172.0 MB. Free memory was 133.2 MB in the beginning and 129.6 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 50.52 ms. Allocated memory is still 172.0 MB. Free memory was 129.6 MB in the beginning and 126.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 41.91 ms. Allocated memory is still 172.0 MB. Free memory was 126.5 MB in the beginning and 124.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1414.56 ms. Allocated memory was 172.0 MB in the beginning and 219.2 MB in the end (delta: 47.2 MB). Free memory was 124.4 MB in the beginning and 183.4 MB in the end (delta: -59.0 MB). Peak memory consumption was 86.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 11360.88 ms. Allocated memory was 219.2 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 183.4 MB in the beginning and 3.5 GB in the end (delta: -3.3 GB). Peak memory consumption was 389.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: 93262, positive: 87936, positive conditional: 87936, positive unconditional: 0, negative: 5326, negative conditional: 5326, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 91243, positive: 87936, positive conditional: 0, positive unconditional: 87936, negative: 3307, negative conditional: 0, negative unconditional: 3307, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1442, positive: 1396, positive conditional: 0, positive unconditional: 1396, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1442, positive: 1392, positive conditional: 0, positive unconditional: 1392, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 50, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 513, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 503, negative conditional: 0, negative unconditional: 503, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 91243, positive: 86540, positive conditional: 0, positive unconditional: 86540, negative: 3261, negative conditional: 0, negative unconditional: 3261, unknown: 1442, unknown conditional: 0, unknown unconditional: 1442] , Statistics on independence cache: Total cache size (in pairs): 1442, Positive cache size: 1396, Positive conditional cache size: 0, Positive unconditional cache size: 1396, Negative cache size: 46, Negative conditional cache size: 0, Negative unconditional cache size: 46, Independence queries for same thread: 2019 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 93262, positive: 87936, positive conditional: 87936, positive unconditional: 0, negative: 5326, negative conditional: 5326, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 91243, positive: 87936, positive conditional: 0, positive unconditional: 87936, negative: 3307, negative conditional: 0, negative unconditional: 3307, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1442, positive: 1396, positive conditional: 0, positive unconditional: 1396, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1442, positive: 1392, positive conditional: 0, positive unconditional: 1392, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 50, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 568, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 562, negative conditional: 0, negative unconditional: 562, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 91243, positive: 86540, positive conditional: 0, positive unconditional: 86540, negative: 3261, negative conditional: 0, negative unconditional: 3261, unknown: 1442, unknown conditional: 0, unknown unconditional: 1442] , Statistics on independence cache: Total cache size (in pairs): 1442, Positive cache size: 1396, Positive conditional cache size: 0, Positive unconditional cache size: 1396, Negative cache size: 46, Negative conditional cache size: 0, Negative unconditional cache size: 46, Independence queries for same thread: 2019 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 93262, positive: 87936, positive conditional: 87936, positive unconditional: 0, negative: 5326, negative conditional: 5326, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 91243, positive: 87936, positive conditional: 0, positive unconditional: 87936, negative: 3307, negative conditional: 0, negative unconditional: 3307, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1442, positive: 1396, positive conditional: 0, positive unconditional: 1396, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1442, positive: 1392, positive conditional: 0, positive unconditional: 1392, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 50, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 737, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 733, negative conditional: 0, negative unconditional: 733, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 91243, positive: 86540, positive conditional: 0, positive unconditional: 86540, negative: 3261, negative conditional: 0, negative unconditional: 3261, unknown: 1442, unknown conditional: 0, unknown unconditional: 1442] , Statistics on independence cache: Total cache size (in pairs): 1442, Positive cache size: 1396, Positive conditional cache size: 0, Positive unconditional cache size: 1396, Negative cache size: 46, Negative conditional cache size: 0, Negative unconditional cache size: 46, Independence queries for same thread: 2019 - 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: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L713] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L715] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L717] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L719] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L721] 0 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0] [L722] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0] [L723] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0] [L725] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L726] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L727] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L728] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L729] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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] [L730] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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] [L731] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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_buff0_thd3=0] [L732] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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_buff0_thd3=0, x$r_buff1_thd0=0] [L733] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L734] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L735] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L736] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L737] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L738] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L739] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L740] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L741] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L743] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L745] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L746] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L747] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L840] 0 pthread_t t891; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L841] FCALL, FORK 0 pthread_create(&t891, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L842] 0 pthread_t t892; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L843] FCALL, FORK 0 pthread_create(&t892, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L844] 0 pthread_t t893; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L771] 2 x$w_buff1 = x$w_buff0 [L772] 2 x$w_buff0 = 2 [L773] 2 x$w_buff1_used = x$w_buff0_used [L774] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L783] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L786] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L789] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L845] FCALL, FORK 0 pthread_create(&t893, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=1] [L809] 3 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=1] [L812] 3 __unbuffered_p2_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=1] [L815] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=1] [L751] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=1] [L754] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=1] [L792] 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) [L792] 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) [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 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 [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L796] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L796] 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 [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L757] 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) [L757] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L757] 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) [L757] 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) [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L758] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L759] 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 [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L760] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L761] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L761] 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 [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L818] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L818] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L818] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L818] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L819] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L819] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L820] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L820] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L821] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L822] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L822] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L825] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L847] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L851] 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) [L851] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L851] 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) [L851] 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) [L852] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L852] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L853] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L853] 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 [L854] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L854] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L855] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L855] 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 [L858] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L859] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L860] 0 x$flush_delayed = weak$$choice2 [L861] 0 x$mem_tmp = x [L862] 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) [L862] 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) [L863] 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)) [L863] 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)) [L864] 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)) [L864] 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)) [L865] 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)) [L865] 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)) [L866] 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)) [L866] 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)) [L867] 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)) [L867] 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)) [L868] 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)) [L868] 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)) [L869] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L870] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L870] 0 x = x$flush_delayed ? x$mem_tmp : x [L871] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P1 with 1 thread instances CFG has 7 procedures, 146 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 2062.9ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 115.7ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1944.8ms, PartialOrderReductionTime: 1937.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=24476occurred 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 7 procedures, 146 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 2523.5ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 186.2ms, AutomataDifference: 250.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1852.4ms, PartialOrderReductionTime: 1850.7ms, HoareTripleCheckerStatistics: 103 SDtfs, 44 SDslu, 73 SDs, 0 SdLazy, 11 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=24476occurred 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: 6.6ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 6.2ms SsaConstructionTime, 36.2ms SatisfiabilityAnalysisTime, 104.9ms InterpolantComputationTime, 53 NumberOfCodeBlocks, 53 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 52 ConstructedInterpolants, 0 QuantifiedInterpolants, 96 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 7 procedures, 146 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 6604.2ms, OverallIterations: 9, TraceHistogramMax: 1, EmptinessCheckTime: 106.1ms, AutomataDifference: 1920.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2070.6ms, PartialOrderReductionTime: 2066.8ms, HoareTripleCheckerStatistics: 1121 SDtfs, 1521 SDslu, 4607 SDs, 0 SdLazy, 574 SolverSat, 86 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 462.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 1147.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=24476occurred in iteration=0, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 925.5ms AutomataMinimizationTime, 8 MinimizatonAttempts, 479 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 36.3ms SsaConstructionTime, 382.1ms SatisfiabilityAnalysisTime, 983.9ms InterpolantComputationTime, 747 NumberOfCodeBlocks, 747 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 648 ConstructedInterpolants, 0 QuantifiedInterpolants, 3100 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...